The number 5391
5391 is a composite number with 6 divisors. Its prime factorisation is × 599. Divisors (6): 1, 3, 9, 599, 1797, 5391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5391 is composite. Its prime factorisation is
- 3
The divisors add up to 7800; without 5391 itself that is 2409, so 5391 is deficient (2409 is less than 5391). Euler's totient φ(5391) = 3588 numbers up to 5391 share no factor with it.
- 4
The digits of 5391 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 28 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5391 = 3^{2} \times 599 \]5391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 7800 |
| Euler totient φ(n) | 3588 |
| Square | 29062881 |
| Cube | 156677991471 |
| Square root | 73.423430 (= 3√599) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 28 |
| Scientific notation | 5.391 × |
5391 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and ninety-one |
| Binary (base 2) | 1010100001111 |
| Octal (base 8) | 12417 |
| Hexadecimal (base 16) | 150F |
| Base 3 | 21101200 |
| As time | 5391 seconds = 1 h 29 min 51 s |
Is 5391 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5391 ÷ 3 = 1797) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (5391 ÷ 9 = 599) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5391 a prime number?
No. 5391 = × 599, so it is divisible by 3.
What are the factors of 5391?
1, 3, 9, 599, 1797, 5391.
What is 5391 in binary?
1010100001111 (hexadecimal 150F, octal 12417).
What is the square root of 5391?
About 73.4234, exactly 3√599.
Is 5391 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 5391?
It is a composite number with 6 divisors.