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