The number 68064
68064 is a composite number with 24 divisors. Its prime factorisation is × 3 × 709. Divisors (24): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 96, 709, 1418, 2127, 2836 … 68064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68064: a Harshad number: divisible by its digit sum 24.
- 2
68064 is composite. Its prime factorisation is
- 3
The divisors add up to 178920; without 68064 itself that is 110856, so 68064 is abundant (110856 is more than 68064). Euler's totient φ(68064) = 22656 numbers up to 68064 share no factor with it.
- 4
The digits of 68064 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68064 = 2^{5} \times 3 \times 709 \]68064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 178920 |
| Euler totient φ(n) | 22656 |
| Square | 4632708096 |
| Cube | 315320643846144 |
| Square root | 260.890782 (= 4√4254) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.8064 × |
68064 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand and sixty-four |
| Binary (base 2) | 10000100111100000 |
| Octal (base 8) | 204740 |
| Hexadecimal (base 16) | 109E0 |
| Base 3 | 10110100220 |
| As time | 68064 seconds = 18 h 54 min 24 s |
Is 68064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68064 ÷ 2 = 34032) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (68064 ÷ 3 = 22688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (68064 ÷ 4 = 17016) | 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 | Yes (68064 ÷ 6 = 11344) | 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 (68064 ÷ 8 = 8508) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (68064 ÷ 12 = 5672) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68064 a prime number?
No. 68064 = × 3 × 709, so it is divisible by 2.
What are the factors of 68064?
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 96, 709, 1418, 2127, 2836, 4254, 5672, 8508, 11344, 17016, 22688, 34032, 68064.
What is 68064 in binary?
10000100111100000 (hexadecimal 109E0, octal 204740).
What is the square root of 68064?
About 260.8908, exactly 4√4254.
Is 68064 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 68064?
68064 is a Harshad number: divisible by its digit sum 24.