The number 85632
85632 is a composite number with 32 divisors. Its prime factorisation is × 3 × 223. Divisors (32): 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 223 … 85632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 85632: a Harshad number: divisible by its digit sum 24.
- 2
85632 is composite. Its prime factorisation is
- 3
The divisors add up to 228480; without 85632 itself that is 142848, so 85632 is abundant (142848 is more than 85632). Euler's totient φ(85632) = 28416 numbers up to 85632 share no factor with it.
- 4
The digits of 85632 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
\[ 85632 = 2^{7} \times 3 \times 223 \]85632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 228480 |
| Euler totient φ(n) | 28416 |
| Square | 7332839424 |
| Cube | 627925705555968 |
| Square root | 292.629459 (= 8√1338) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.5632 × |
85632 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand six hundred and thirty-two |
| Binary (base 2) | 10100111010000000 |
| Octal (base 8) | 247200 |
| Hexadecimal (base 16) | 14E80 |
| Base 3 | 11100110120 |
| As time | 85632 seconds = 23 h 47 min 12 s |
Is 85632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (85632 ÷ 2 = 42816) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (85632 ÷ 3 = 28544) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (85632 ÷ 4 = 21408) | 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 | Yes (85632 ÷ 6 = 14272) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (85632 ÷ 8 = 10704) | 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 2) | 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 | Yes (85632 ÷ 12 = 7136) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85632 a prime number?
No. 85632 = × 3 × 223, so it is divisible by 2.
What are the factors of 85632?
1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 223, 384, 446, 669, 892, 1338, 1784, 2676, 3568, 5352, 7136, 10704, 14272, 21408, 28544, 42816, 85632.
What is 85632 in binary?
10100111010000000 (hexadecimal 14E80, octal 247200).
What is the square root of 85632?
About 292.6295, exactly 8√1338.
Is 85632 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 85632?
85632 is a Harshad number: divisible by its digit sum 24.