The number 89632
89632 is a composite number with 12 divisors. Its prime factorisation is × 2801. Divisors (12): 1, 2, 4, 8, 16, 32, 2801, 5602, 11204, 22408, 44816, 89632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
89632 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
89632 is composite. Its prime factorisation is
- 3
The divisors add up to 176526; without 89632 itself that is 86894, so 89632 is deficient (86894 is less than 89632). Euler's totient φ(89632) = 44800 numbers up to 89632 share no factor with it.
- 4
The digits of 89632 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89632 = 2^{5} \times 2801 \]89632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 176526 |
| Euler totient φ(n) | 44800 |
| Square | 8033895424 |
| Cube | 720094114643968 |
| Square root | 299.386038 (= 4√5602) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 40 |
| Scientific notation | 8.9632 × |
89632 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand six hundred and thirty-two |
| Binary (base 2) | 10101111000100000 |
| Octal (base 8) | 257040 |
| Hexadecimal (base 16) | 15E20 |
| Base 3 | 11112221201 |
| As time | 89632 seconds = 24 h 53 min 52 s |
Is 89632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (89632 ÷ 2 = 44816) | 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 (89632 ÷ 4 = 22408) | 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 4) | 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 (89632 ÷ 8 = 11204) | 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 4) | 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 89632 a prime number?
No. 89632 = × 2801, so it is divisible by 2.
What are the factors of 89632?
1, 2, 4, 8, 16, 32, 2801, 5602, 11204, 22408, 44816, 89632.
What is 89632 in binary?
10101111000100000 (hexadecimal 15E20, octal 257040).
What is the square root of 89632?
About 299.3860, exactly 4√5602.
Is 89632 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 89632?
It is a composite number with 12 divisors.