The number 59121
59121 is a composite number with 6 divisors. Its prime factorisation is × 6569. Divisors (6): 1, 3, 9, 6569, 19707, 59121.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59121 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59121 is composite. Its prime factorisation is
- 3
The divisors add up to 85410; without 59121 itself that is 26289, so 59121 is deficient (26289 is less than 59121). Euler's totient φ(59121) = 39408 numbers up to 59121 share no factor with it.
- 4
The digits of 59121 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 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59121 = 3^{2} \times 6569 \]59121 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 85410 |
| Euler totient φ(n) | 39408 |
| Square | 3495292641 |
| Cube | 206645196228561 |
| Square root | 243.148103 (= 3√6569) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9121 × |
59121 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and twenty-one |
| Binary (base 2) | 1110011011110001 |
| Octal (base 8) | 163361 |
| Hexadecimal (base 16) | E6F1 |
| Base 3 | 10000002200 |
| As time | 59121 seconds = 16 h 25 min 21 s |
Is 59121 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 (59121 ÷ 3 = 19707) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 6) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (59121 ÷ 9 = 6569) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59121 a prime number?
No. 59121 = × 6569, so it is divisible by 3.
What are the factors of 59121?
1, 3, 9, 6569, 19707, 59121.
What is 59121 in binary?
1110011011110001 (hexadecimal E6F1, octal 163361).
What is the square root of 59121?
About 243.1481, exactly 3√6569.
Is 59121 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 59121?
It is a composite number with 6 divisors.