The number 86064
86064 is a composite number with 40 divisors. Its prime factorisation is × 3 × 11 × 163. Divisors (40): 1, 2, 3, 4, 6, 8, 11, 12, 16, 22, 24, 33, 44, 48, 66, 88 … 86064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86064: a Harshad number: divisible by its digit sum 24.
- 2
86064 is composite. Its prime factorisation is
- 3
The divisors add up to 244032; without 86064 itself that is 157968, so 86064 is abundant (157968 is more than 86064). Euler's totient φ(86064) = 25920 numbers up to 86064 share no factor with it.
- 4
The digits of 86064 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86064 = 2^{4} \times 3 \times 11 \times 163 \]86064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 244032 |
| Euler totient φ(n) | 25920 |
| Square | 7407012096 |
| Cube | 637477089030144 |
| Square root | 293.366665 (= 4√5379) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.6064 × |
86064 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand and sixty-four |
| Binary (base 2) | 10101000000110000 |
| Octal (base 8) | 250060 |
| Hexadecimal (base 16) | 15030 |
| Base 3 | 11101001120 |
| As time | 86064 seconds = 23 h 54 min 24 s |
Is 86064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (86064 ÷ 2 = 43032) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (86064 ÷ 3 = 28688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (86064 ÷ 4 = 21516) | 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 (86064 ÷ 6 = 14344) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (86064 ÷ 8 = 10758) | 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 | Yes (86064 ÷ 11 = 7824) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (86064 ÷ 12 = 7172) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 86064 a prime number?
No. 86064 = × 3 × 11 × 163, so it is divisible by 2.
What are the factors of 86064?
1, 2, 3, 4, 6, 8, 11, 12, 16, 22, 24, 33, 44, 48, 66, 88, 132, 163, 176, 264, 326, 489, 528, 652, 978, 1304, 1793, 1956, 2608, 3586, 3912, 5379, 7172, 7824, 10758, 14344, 21516, 28688, 43032, 86064.
What is 86064 in binary?
10101000000110000 (hexadecimal 15030, octal 250060).
What is the square root of 86064?
About 293.3667, exactly 4√5379.
Is 86064 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 86064?
86064 is a Harshad number: divisible by its digit sum 24.