The number 53064
53064 is a composite number with 48 divisors. Its prime factorisation is × × 11 × 67. Divisors (48): 1, 2, 3, 4, 6, 8, 9, 11, 12, 18, 22, 24, 33, 36, 44, 66 … 53064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53064: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
53064 is composite. Its prime factorisation is
- 3
The divisors add up to 159120; without 53064 itself that is 106056, so 53064 is abundant (106056 is more than 53064). Euler's totient φ(53064) = 15840 numbers up to 53064 share no factor with it.
- 4
The digits of 53064 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53064 = 2^{3} \times 3^{2} \times 11 \times 67 \]53064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 159120 |
| Euler totient φ(n) | 15840 |
| Square | 2815788096 |
| Cube | 149416979526144 |
| Square root | 230.356246 (= 6√1474) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3064 × |
53064 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and sixty-four |
| Binary (base 2) | 1100111101001000 |
| Octal (base 8) | 147510 |
| Hexadecimal (base 16) | CF48 |
| Base 3 | 2200210100 |
| As time | 53064 seconds = 14 h 44 min 24 s |
Is 53064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53064 ÷ 2 = 26532) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (53064 ÷ 3 = 17688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (53064 ÷ 4 = 13266) | 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 (53064 ÷ 6 = 8844) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (53064 ÷ 8 = 6633) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (53064 ÷ 9 = 5896) | 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 | Yes (53064 ÷ 11 = 4824) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (53064 ÷ 12 = 4422) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53064 a prime number?
No. 53064 = × × 11 × 67, so it is divisible by 2.
What are the factors of 53064?
1, 2, 3, 4, 6, 8, 9, 11, 12, 18, 22, 24, 33, 36, 44, 66, 67, 72, 88, 99, 132, 134, 198, 201, 264, 268, 396, 402, 536, 603, 737, 792, 804, 1206, 1474, 1608, 2211, 2412, 2948, 4422, 4824, 5896, 6633, 8844, 13266, 17688, 26532, 53064.
What is 53064 in binary?
1100111101001000 (hexadecimal CF48, octal 147510).
What is the square root of 53064?
About 230.3562, exactly 6√1474.
Is 53064 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 53064?
53064 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.