The number 12064
12064 is a composite number with 24 divisors. Its prime factorisation is × 13 × 29. Divisors (24): 1, 2, 4, 8, 13, 16, 26, 29, 32, 52, 58, 104, 116, 208, 232, 377 … 12064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12064: a Harshad number: divisible by its digit sum 13.
- 2
12064 is composite. Its prime factorisation is
- 3
The divisors add up to 26460; without 12064 itself that is 14396, so 12064 is abundant (14396 is more than 12064). Euler's totient φ(12064) = 5376 numbers up to 12064 share no factor with it.
- 4
The digits of 12064 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 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12064 = 2^{5} \times 13 \times 29 \]12064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 26460 |
| Euler totient φ(n) | 5376 |
| Square | 145540096 |
| Cube | 1755795718144 |
| Square root | 109.836242 (= 4√754) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.2064 × |
12064 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand and sixty-four |
| Binary (base 2) | 10111100100000 |
| Octal (base 8) | 27440 |
| Hexadecimal (base 16) | 2F20 |
| Base 3 | 121112211 |
| As time | 12064 seconds = 3 h 21 min 4 s |
Is 12064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12064 ÷ 2 = 6032) | 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 (12064 ÷ 4 = 3016) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 3) | 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 (12064 ÷ 8 = 1508) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 12064 a prime number?
No. 12064 = × 13 × 29, so it is divisible by 2.
What are the factors of 12064?
1, 2, 4, 8, 13, 16, 26, 29, 32, 52, 58, 104, 116, 208, 232, 377, 416, 464, 754, 928, 1508, 3016, 6032, 12064.
What is 12064 in binary?
10111100100000 (hexadecimal 2F20, octal 27440).
What is the square root of 12064?
About 109.8362, exactly 4√754.
Is 12064 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 12064?
12064 is a Harshad number: divisible by its digit sum 13.