The number 89011
89011 is a composite number with 8 divisors. Its prime factorisation is 13 × 41 × 167. Divisors (8): 1, 13, 41, 167, 533, 2171, 6847, 89011.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
89011 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
89011 is composite. Its prime factorisation is
- 3
The divisors add up to 98784; without 89011 itself that is 9773, so 89011 is deficient (9773 is less than 89011). Euler's totient φ(89011) = 79680 numbers up to 89011 share no factor with it.
- 4
The digits of 89011 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 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89011 = 13 \times 41 \times 167 \]
89011 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 98784 |
| Euler totient φ(n) | 79680 |
| Square | 7922958121 |
| Cube | 705230425308331 |
| Square root | 298.347113 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 120 |
| Scientific notation | 8.9011 × |
89011 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand and eleven |
| Binary (base 2) | 10101101110110011 |
| Octal (base 8) | 255663 |
| Hexadecimal (base 16) | 15BB3 |
| Base 3 | 11112002201 |
| As time | 89011 seconds = 24 h 43 min 31 s |
Is 89011 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 | No (remainder 6) | 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 3) | 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 | No (remainder 10) | 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 89011 a prime number?
No. 89011 = 13 × 41 × 167, so it is divisible by 13.
What are the factors of 89011?
1, 13, 41, 167, 533, 2171, 6847, 89011.
What is 89011 in binary?
10101101110110011 (hexadecimal 15BB3, octal 255663).
What is the square root of 89011?
About 298.3471.
Is 89011 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 89011?
It is a composite number with 8 divisors.