The number 64752
64752 is a composite number with 40 divisors. Its prime factorisation is × 3 × 19 × 71. Divisors (40): 1, 2, 3, 4, 6, 8, 12, 16, 19, 24, 38, 48, 57, 71, 76, 114 … 64752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64752: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 24.
- 2
64752 is composite. Its prime factorisation is
- 3
The divisors add up to 178560; without 64752 itself that is 113808, so 64752 is abundant (113808 is more than 64752). Euler's totient φ(64752) = 20160 numbers up to 64752 share no factor with it.
- 4
The digits of 64752 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 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64752 = 2^{4} \times 3 \times 19 \times 71 \]64752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 178560 |
| Euler totient φ(n) | 20160 |
| Square | 4192821504 |
| Cube | 271493578027008 |
| Square root | 254.464143 (= 4√4047) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 161 |
| Scientific notation | 6.4752 × |
64752 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand seven hundred and fifty-two |
| Binary (base 2) | 1111110011110000 |
| Octal (base 8) | 176360 |
| Hexadecimal (base 16) | FCF0 |
| Base 3 | 10021211020 |
| As time | 64752 seconds = 17 h 59 min 12 s |
Is 64752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64752 ÷ 2 = 32376) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64752 ÷ 3 = 21584) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (64752 ÷ 4 = 16188) | 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 (64752 ÷ 6 = 10792) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (64752 ÷ 8 = 8094) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (64752 ÷ 12 = 5396) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64752 a prime number?
No. 64752 = × 3 × 19 × 71, so it is divisible by 2.
What are the factors of 64752?
1, 2, 3, 4, 6, 8, 12, 16, 19, 24, 38, 48, 57, 71, 76, 114, 142, 152, 213, 228, 284, 304, 426, 456, 568, 852, 912, 1136, 1349, 1704, 2698, 3408, 4047, 5396, 8094, 10792, 16188, 21584, 32376, 64752.
What is 64752 in binary?
1111110011110000 (hexadecimal FCF0, octal 176360).
What is the square root of 64752?
About 254.4641, exactly 4√4047.
Is 64752 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 64752?
64752 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 24.