The number 5390
5390 is a composite number with 24 divisors. Its prime factorisation is 2 × 5 × × 11. Divisors (24): 1, 2, 5, 7, 10, 11, 14, 22, 35, 49, 55, 70, 77, 98, 110, 154 … 5390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5390 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5390 is composite. Its prime factorisation is
- 3
The divisors add up to 12312; without 5390 itself that is 6922, so 5390 is abundant (6922 is more than 5390). Euler's totient φ(5390) = 1680 numbers up to 5390 share no factor with it.
- 4
The digits of 5390 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 28 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5390 = 2 \times 5 \times 7^{2} \times 11 \]5390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 12312 |
| Euler totient φ(n) | 1680 |
| Square | 29052100 |
| Cube | 156590819000 |
| Square root | 73.416619 (= 7√110) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 28 |
| Scientific notation | 5.39 × |
5390 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and ninety |
| Binary (base 2) | 1010100001110 |
| Octal (base 8) | 12416 |
| Hexadecimal (base 16) | 150E |
| Base 3 | 21101122 |
| As time | 5390 seconds = 1 h 29 min 50 s |
Is 5390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5390 ÷ 2 = 2695) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5390 ÷ 5 = 1078) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5390 ÷ 7 = 770) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5390 ÷ 10 = 539) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (5390 ÷ 11 = 490) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5390 a prime number?
No. 5390 = 2 × 5 × × 11, so it is divisible by 2.
What are the factors of 5390?
1, 2, 5, 7, 10, 11, 14, 22, 35, 49, 55, 70, 77, 98, 110, 154, 245, 385, 490, 539, 770, 1078, 2695, 5390.
What is 5390 in binary?
1010100001110 (hexadecimal 150E, octal 12416).
What is the square root of 5390?
About 73.4166, exactly 7√110.
Is 5390 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 5390?
It is a composite number with 24 divisors.