The number 64052
64052 is a composite number with 12 divisors. Its prime factorisation is × 67 × 239. Divisors (12): 1, 2, 4, 67, 134, 239, 268, 478, 956, 16013, 32026, 64052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64052 is composite. Its prime factorisation is
- 3
The divisors add up to 114240; without 64052 itself that is 50188, so 64052 is deficient (50188 is less than 64052). Euler's totient φ(64052) = 31416 numbers up to 64052 share no factor with it.
- 4
The digits of 64052 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64052 = 2^{2} \times 67 \times 239 \]64052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 114240 |
| Euler totient φ(n) | 31416 |
| Square | 4102658704 |
| Cube | 262783495308608 |
| Square root | 253.084966 (= 2√16013) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.4052 × |
64052 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand and fifty-two |
| Binary (base 2) | 1111101000110100 |
| Octal (base 8) | 175064 |
| Hexadecimal (base 16) | FA34 |
| Base 3 | 10020212022 |
| As time | 64052 seconds = 17 h 47 min 32 s |
Is 64052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64052 ÷ 2 = 32026) | 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 (64052 ÷ 4 = 16013) | 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 2) | 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 | No (remainder 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 64052 a prime number?
No. 64052 = × 67 × 239, so it is divisible by 2.
What are the factors of 64052?
1, 2, 4, 67, 134, 239, 268, 478, 956, 16013, 32026, 64052.
What is 64052 in binary?
1111101000110100 (hexadecimal FA34, octal 175064).
What is the square root of 64052?
About 253.0850, exactly 2√16013.
Is 64052 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 64052?
It is a composite number with 12 divisors.