The number 89481
89481 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 4261. Divisors (8): 1, 3, 7, 21, 4261, 12783, 29827, 89481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89481: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
89481 is composite. Its prime factorisation is
- 3
The divisors add up to 136384; without 89481 itself that is 46903, so 89481 is deficient (46903 is less than 89481). Euler's totient φ(89481) = 51120 numbers up to 89481 share no factor with it.
- 4
The digits of 89481 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 270 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89481 = 3 \times 7 \times 4261 \]
89481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 136384 |
| Euler totient φ(n) | 51120 |
| Square | 8006849361 |
| Cube | 716460887671641 |
| Square root | 299.133749 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 270 |
| Scientific notation | 8.9481 × |
89481 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand four hundred and eighty-one |
| Binary (base 2) | 10101110110001001 |
| Octal (base 8) | 256611 |
| Hexadecimal (base 16) | 15D89 |
| Base 3 | 11112202010 |
| As time | 89481 seconds = 24 h 51 min 21 s |
Is 89481 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 (89481 ÷ 3 = 29827) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 | Yes (89481 ÷ 7 = 12783) | 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 1) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89481 a prime number?
No. 89481 = 3 × 7 × 4261, so it is divisible by 3.
What are the factors of 89481?
1, 3, 7, 21, 4261, 12783, 29827, 89481.
What is 89481 in binary?
10101110110001001 (hexadecimal 15D89, octal 256611).
What is the square root of 89481?
About 299.1337.
Is 89481 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 89481?
89481 is a happy number: repeatedly adding the squares of its digits reaches 1.