The number 89551
89551 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 1163. Divisors (8): 1, 7, 11, 77, 1163, 8141, 12793, 89551.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
89551 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
89551 is composite. Its prime factorisation is
- 3
The divisors add up to 111744; without 89551 itself that is 22193, so 89551 is deficient (22193 is less than 89551). Euler's totient φ(89551) = 69720 numbers up to 89551 share no factor with it.
- 4
The digits of 89551 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 239 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89551 = 7 \times 11 \times 1163 \]
89551 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 111744 |
| Euler totient φ(n) | 69720 |
| Square | 8019381601 |
| Cube | 718143641751151 |
| Square root | 299.250731 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 239 |
| Scientific notation | 8.9551 × |
89551 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand five hundred and fifty-one |
| Binary (base 2) | 10101110111001111 |
| Octal (base 8) | 256717 |
| Hexadecimal (base 16) | 15DCF |
| Base 3 | 11112211201 |
| As time | 89551 seconds = 24 h 52 min 31 s |
Is 89551 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (89551 ÷ 7 = 12793) | 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 | No (remainder 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (89551 ÷ 11 = 8141) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89551 a prime number?
No. 89551 = 7 × 11 × 1163, so it is divisible by 7.
What are the factors of 89551?
1, 7, 11, 77, 1163, 8141, 12793, 89551.
What is 89551 in binary?
10101110111001111 (hexadecimal 15DCF, octal 256717).
What is the square root of 89551?
About 299.2507.
Is 89551 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 89551?
It is a composite number with 8 divisors.