The number 59064
59064 is a composite number with 32 divisors. Its prime factorisation is × 3 × 23 × 107. Divisors (32): 1, 2, 3, 4, 6, 8, 12, 23, 24, 46, 69, 92, 107, 138, 184, 214 … 59064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59064: a Harshad number: divisible by its digit sum 24.
- 2
59064 is composite. Its prime factorisation is
- 3
The divisors add up to 155520; without 59064 itself that is 96456, so 59064 is abundant (96456 is more than 59064). Euler's totient φ(59064) = 18656 numbers up to 59064 share no factor with it.
- 4
The digits of 59064 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59064 = 2^{3} \times 3 \times 23 \times 107 \]59064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 155520 |
| Euler totient φ(n) | 18656 |
| Square | 3488556096 |
| Cube | 206048077254144 |
| Square root | 243.030862 (= 2√14766) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9064 × |
59064 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and sixty-four |
| Binary (base 2) | 1110011010111000 |
| Octal (base 8) | 163270 |
| Hexadecimal (base 16) | E6B8 |
| Base 3 | 10000000120 |
| As time | 59064 seconds = 16 h 24 min 24 s |
Is 59064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59064 ÷ 2 = 29532) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59064 ÷ 3 = 19688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (59064 ÷ 4 = 14766) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (59064 ÷ 6 = 9844) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (59064 ÷ 8 = 7383) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (59064 ÷ 12 = 4922) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59064 a prime number?
No. 59064 = × 3 × 23 × 107, so it is divisible by 2.
What are the factors of 59064?
1, 2, 3, 4, 6, 8, 12, 23, 24, 46, 69, 92, 107, 138, 184, 214, 276, 321, 428, 552, 642, 856, 1284, 2461, 2568, 4922, 7383, 9844, 14766, 19688, 29532, 59064.
What is 59064 in binary?
1110011010111000 (hexadecimal E6B8, octal 163270).
What is the square root of 59064?
About 243.0309, exactly 2√14766.
Is 59064 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 59064?
59064 is a Harshad number: divisible by its digit sum 24.