The number 89552
89552 is a composite number with 20 divisors. Its prime factorisation is × 29 × 193. Divisors (20): 1, 2, 4, 8, 16, 29, 58, 116, 193, 232, 386, 464, 772, 1544, 3088, 5597 … 89552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89552: a Harshad number: divisible by its digit sum 29.
- 2
89552 is composite. Its prime factorisation is
- 3
The divisors add up to 180420; without 89552 itself that is 90868, so 89552 is abundant (90868 is more than 89552). Euler's totient φ(89552) = 43008 numbers up to 89552 share no factor with it.
- 4
The digits of 89552 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89552 = 2^{4} \times 29 \times 193 \]89552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 180420 |
| Euler totient φ(n) | 43008 |
| Square | 8019560704 |
| Cube | 718167700164608 |
| Square root | 299.252402 (= 4√5597) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 71 |
| Scientific notation | 8.9552 × |
89552 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand five hundred and fifty-two |
| Binary (base 2) | 10101110111010000 |
| Octal (base 8) | 256720 |
| Hexadecimal (base 16) | 15DD0 |
| Base 3 | 11112211202 |
| As time | 89552 seconds = 24 h 52 min 32 s |
Is 89552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (89552 ÷ 2 = 44776) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (89552 ÷ 4 = 22388) | 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 2) | 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 (89552 ÷ 8 = 11194) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89552 a prime number?
No. 89552 = × 29 × 193, so it is divisible by 2.
What are the factors of 89552?
1, 2, 4, 8, 16, 29, 58, 116, 193, 232, 386, 464, 772, 1544, 3088, 5597, 11194, 22388, 44776, 89552.
What is 89552 in binary?
10101110111010000 (hexadecimal 15DD0, octal 256720).
What is the square root of 89552?
About 299.2524, exactly 4√5597.
Is 89552 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 89552?
89552 is a Harshad number: divisible by its digit sum 29.