The number 64012
64012 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1231. Divisors (12): 1, 2, 4, 13, 26, 52, 1231, 2462, 4924, 16003, 32006, 64012.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64012: a Harshad number: divisible by its digit sum 13.
- 2
64012 is composite. Its prime factorisation is
- 3
The divisors add up to 120736; without 64012 itself that is 56724, so 64012 is deficient (56724 is less than 64012). Euler's totient φ(64012) = 29520 numbers up to 64012 share no factor with it.
- 4
The digits of 64012 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64012 = 2^{2} \times 13 \times 1231 \]64012 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 120736 |
| Euler totient φ(n) | 29520 |
| Square | 4097536144 |
| Cube | 262291483649728 |
| Square root | 253.005929 (= 2√16003) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.4012 × |
64012 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand and twelve |
| Binary (base 2) | 1111101000001100 |
| Octal (base 8) | 175014 |
| Hexadecimal (base 16) | FA0C |
| Base 3 | 10020210211 |
| As time | 64012 seconds = 17 h 46 min 52 s |
Is 64012 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64012 ÷ 2 = 32006) | 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 (64012 ÷ 4 = 16003) | 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 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 | No (remainder 4) | 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 3) | 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 64012 a prime number?
No. 64012 = × 13 × 1231, so it is divisible by 2.
What are the factors of 64012?
1, 2, 4, 13, 26, 52, 1231, 2462, 4924, 16003, 32006, 64012.
What is 64012 in binary?
1111101000001100 (hexadecimal FA0C, octal 175014).
What is the square root of 64012?
About 253.0059, exactly 2√16003.
Is 64012 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 64012?
64012 is a Harshad number: divisible by its digit sum 13.