The number 59391
59391 is a composite number with 6 divisors. Its prime factorisation is × 6599. Divisors (6): 1, 3, 9, 6599, 19797, 59391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59391 is composite. Its prime factorisation is
- 3
The divisors add up to 85800; without 59391 itself that is 26409, so 59391 is deficient (26409 is less than 59391). Euler's totient φ(59391) = 39588 numbers up to 59391 share no factor with it.
- 4
The digits of 59391 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59391 = 3^{2} \times 6599 \]59391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 85800 |
| Euler totient φ(n) | 39588 |
| Square | 3527290881 |
| Cube | 209489332713471 |
| Square root | 243.702688 (= 3√6599) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 179 |
| Scientific notation | 5.9391 × |
59391 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand three hundred and ninety-one |
| Binary (base 2) | 1110011111111111 |
| Octal (base 8) | 163777 |
| Hexadecimal (base 16) | E7FF |
| Base 3 | 10000110200 |
| As time | 59391 seconds = 16 h 29 min 51 s |
Is 59391 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 (59391 ÷ 3 = 19797) | 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 3) | 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 (59391 ÷ 9 = 6599) | 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 2) | 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 59391 a prime number?
No. 59391 = × 6599, so it is divisible by 3.
What are the factors of 59391?
1, 3, 9, 6599, 19797, 59391.
What is 59391 in binary?
1110011111111111 (hexadecimal E7FF, octal 163777).
What is the square root of 59391?
About 243.7027, exactly 3√6599.
Is 59391 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 59391?
It is a composite number with 6 divisors.