The number 89391
89391 is a composite number with 8 divisors. Its prime factorisation is 3 × 83 × 359. Divisors (8): 1, 3, 83, 249, 359, 1077, 29797, 89391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89391: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
89391 is composite. Its prime factorisation is
- 3
The divisors add up to 120960; without 89391 itself that is 31569, so 89391 is deficient (31569 is less than 89391). Euler's totient φ(89391) = 58712 numbers up to 89391 share no factor with it.
- 4
The digits of 89391 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 239 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89391 = 3 \times 83 \times 359 \]
89391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 120960 |
| Euler totient φ(n) | 58712 |
| Square | 7990750881 |
| Cube | 714301212003471 |
| Square root | 298.983277 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 239 |
| Scientific notation | 8.9391 × |
89391 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand three hundred and ninety-one |
| Binary (base 2) | 10101110100101111 |
| Octal (base 8) | 256457 |
| Hexadecimal (base 16) | 15D2F |
| Base 3 | 11112121210 |
| As time | 89391 seconds = 24 h 49 min 51 s |
Is 89391 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 | Yes (89391 ÷ 3 = 29797) | 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 3) | 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89391 a prime number?
No. 89391 = 3 × 83 × 359, so it is divisible by 3.
What are the factors of 89391?
1, 3, 83, 249, 359, 1077, 29797, 89391.
What is 89391 in binary?
10101110100101111 (hexadecimal 15D2F, octal 256457).
What is the square root of 89391?
About 298.9833.
Is 89391 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 89391?
89391 is a happy number: repeatedly adding the squares of its digits reaches 1.