The number 64212
64212 is a composite number with 12 divisors. Its prime factorisation is × 3 × 5351. Divisors (12): 1, 2, 3, 4, 6, 12, 5351, 10702, 16053, 21404, 32106, 64212.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64212 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64212 is composite. Its prime factorisation is
- 3
The divisors add up to 149856; without 64212 itself that is 85644, so 64212 is abundant (85644 is more than 64212). Euler's totient φ(64212) = 21400 numbers up to 64212 share no factor with it.
- 4
The digits of 64212 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64212 = 2^{2} \times 3 \times 5351 \]64212 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 149856 |
| Euler totient φ(n) | 21400 |
| Square | 4123180944 |
| Cube | 264757694776128 |
| Square root | 253.400868 (= 2√16053) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 47 |
| Scientific notation | 6.4212 × |
64212 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand two hundred and twelve |
| Binary (base 2) | 1111101011010100 |
| Octal (base 8) | 175324 |
| Hexadecimal (base 16) | FAD4 |
| Base 3 | 10021002020 |
| As time | 64212 seconds = 17 h 50 min 12 s |
Is 64212 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64212 ÷ 2 = 32106) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64212 ÷ 3 = 21404) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (64212 ÷ 4 = 16053) | 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 (64212 ÷ 6 = 10702) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (64212 ÷ 12 = 5351) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64212 a prime number?
No. 64212 = × 3 × 5351, so it is divisible by 2.
What are the factors of 64212?
1, 2, 3, 4, 6, 12, 5351, 10702, 16053, 21404, 32106, 64212.
What is 64212 in binary?
1111101011010100 (hexadecimal FAD4, octal 175324).
What is the square root of 64212?
About 253.4009, exactly 2√16053.
Is 64212 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 64212?
It is a composite number with 12 divisors.