The number 86032
86032 is a composite number with 20 divisors. Its prime factorisation is × 19 × 283. Divisors (20): 1, 2, 4, 8, 16, 19, 38, 76, 152, 283, 304, 566, 1132, 2264, 4528, 5377 … 86032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 86032: a Harshad number: divisible by its digit sum 19.
- 2
86032 is composite. Its prime factorisation is
- 3
The divisors add up to 176080; without 86032 itself that is 90048, so 86032 is abundant (90048 is more than 86032). Euler's totient φ(86032) = 40608 numbers up to 86032 share no factor with it.
- 4
The digits of 86032 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 86032 = 2^{4} \times 19 \times 283 \]86032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 176080 |
| Euler totient φ(n) | 40608 |
| Square | 7401505024 |
| Cube | 636766280224768 |
| Square root | 293.312120 (= 4√5377) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.6032 × |
86032 in other forms
| Form | Value |
|---|---|
| In words | eighty-six thousand and thirty-two |
| Binary (base 2) | 10101000000010000 |
| Octal (base 8) | 250020 |
| Hexadecimal (base 16) | 15010 |
| Base 3 | 11101000101 |
| As time | 86032 seconds = 23 h 53 min 52 s |
Is 86032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (86032 ÷ 2 = 43016) | 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 (86032 ÷ 4 = 21508) | 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 2) | 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 (86032 ÷ 8 = 10754) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | 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 86032 a prime number?
No. 86032 = × 19 × 283, so it is divisible by 2.
What are the factors of 86032?
1, 2, 4, 8, 16, 19, 38, 76, 152, 283, 304, 566, 1132, 2264, 4528, 5377, 10754, 21508, 43016, 86032.
What is 86032 in binary?
10101000000010000 (hexadecimal 15010, octal 250020).
What is the square root of 86032?
About 293.3121, exactly 4√5377.
Is 86032 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 86032?
86032 is a Harshad number: divisible by its digit sum 19.