The number 56064
56064 is a composite number with 36 divisors. Its prime factorisation is × 3 × 73. Divisors (36): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 73, 96, 128, 146 … 56064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56064 is composite. Its prime factorisation is
- 3
The divisors add up to 151256; without 56064 itself that is 95192, so 56064 is abundant (95192 is more than 56064). Euler's totient φ(56064) = 18432 numbers up to 56064 share no factor with it.
- 4
The digits of 56064 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56064 = 2^{8} \times 3 \times 73 \]56064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 151256 |
| Euler totient φ(n) | 18432 |
| Square | 3143172096 |
| Cube | 176218800390144 |
| Square root | 236.778377 (= 16√219) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6064 × |
56064 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and sixty-four |
| Binary (base 2) | 1101101100000000 |
| Octal (base 8) | 155400 |
| Hexadecimal (base 16) | DB00 |
| Base 3 | 2211220110 |
| As time | 56064 seconds = 15 h 34 min 24 s |
Is 56064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56064 ÷ 2 = 28032) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56064 ÷ 3 = 18688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56064 ÷ 4 = 14016) | 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 (56064 ÷ 6 = 9344) | 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 | Yes (56064 ÷ 8 = 7008) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (56064 ÷ 12 = 4672) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56064 a prime number?
No. 56064 = × 3 × 73, so it is divisible by 2.
What are the factors of 56064?
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 73, 96, 128, 146, 192, 219, 256, 292, 384, 438, 584, 768, 876, 1168, 1752, 2336, 3504, 4672, 7008, 9344, 14016, 18688, 28032, 56064.
What is 56064 in binary?
1101101100000000 (hexadecimal DB00, octal 155400).
What is the square root of 56064?
About 236.7784, exactly 16√219.
Is 56064 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 56064?
It is a composite number with 36 divisors.