The number 64152
64152 is a composite number with 56 divisors. Its prime factorisation is × × 11. Divisors (56): 1, 2, 3, 4, 6, 8, 9, 11, 12, 18, 22, 24, 27, 33, 36, 44 … 64152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64152: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
64152 is composite. Its prime factorisation is
- 3
The divisors add up to 196740; without 64152 itself that is 132588, so 64152 is abundant (132588 is more than 64152). Euler's totient φ(64152) = 19440 numbers up to 64152 share no factor with it.
- 4
The digits of 64152 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 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64152 = 2^{3} \times 3^{6} \times 11 \]64152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 56 |
| Sum of divisors | 196740 |
| Euler totient φ(n) | 19440 |
| Square | 4115479104 |
| Cube | 264016215479808 |
| Square root | 253.282451 (= 54√22) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 161 |
| Scientific notation | 6.4152 × |
64152 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand one hundred and fifty-two |
| Binary (base 2) | 1111101010011000 |
| Octal (base 8) | 175230 |
| Hexadecimal (base 16) | FA98 |
| Base 3 | 10021000000 |
| As time | 64152 seconds = 17 h 49 min 12 s |
Is 64152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64152 ÷ 2 = 32076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64152 ÷ 3 = 21384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (64152 ÷ 4 = 16038) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (64152 ÷ 6 = 10692) | 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 (64152 ÷ 8 = 8019) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (64152 ÷ 9 = 7128) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (64152 ÷ 11 = 5832) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (64152 ÷ 12 = 5346) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64152 a prime number?
No. 64152 = × × 11, so it is divisible by 2.
What are the factors of 64152?
1, 2, 3, 4, 6, 8, 9, 11, 12, 18, 22, 24, 27, 33, 36, 44, 54, 66, 72, 81, 88, 99, 108, 132, 162, 198, 216, 243, 264, 297, 324, 396, 486, 594, 648, 729, 792, 891, 972, 1188, 1458, 1782, 1944, 2376, 2673, 2916, 3564, 5346, 5832, 7128, 8019, 10692, 16038, 21384, 32076, 64152.
What is 64152 in binary?
1111101010011000 (hexadecimal FA98, octal 175230).
What is the square root of 64152?
About 253.2825, exactly 54√22.
Is 64152 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 64152?
64152 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.