The number 52064
52064 is a composite number with 12 divisors. Its prime factorisation is × 1627. Divisors (12): 1, 2, 4, 8, 16, 32, 1627, 3254, 6508, 13016, 26032, 52064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52064 is composite. Its prime factorisation is
- 3
The divisors add up to 102564; without 52064 itself that is 50500, so 52064 is deficient (50500 is less than 52064). Euler's totient φ(52064) = 26016 numbers up to 52064 share no factor with it.
- 4
The digits of 52064 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52064 = 2^{5} \times 1627 \]52064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 102564 |
| Euler totient φ(n) | 26016 |
| Square | 2710660096 |
| Cube | 141127807238144 |
| Square root | 228.175371 (= 4√3254) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.2064 × |
52064 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand and sixty-four |
| Binary (base 2) | 1100101101100000 |
| Octal (base 8) | 145540 |
| Hexadecimal (base 16) | CB60 |
| Base 3 | 2122102022 |
| As time | 52064 seconds = 14 h 27 min 44 s |
Is 52064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52064 ÷ 2 = 26032) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (52064 ÷ 4 = 13016) | 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 | No (remainder 2) | 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 (52064 ÷ 8 = 6508) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52064 a prime number?
No. 52064 = × 1627, so it is divisible by 2.
What are the factors of 52064?
1, 2, 4, 8, 16, 32, 1627, 3254, 6508, 13016, 26032, 52064.
What is 52064 in binary?
1100101101100000 (hexadecimal CB60, octal 145540).
What is the square root of 52064?
About 228.1754, exactly 4√3254.
Is 52064 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 52064?
It is a composite number with 12 divisors.