The number 89476
89476 is a composite number with 6 divisors. Its prime factorisation is × 22369. Divisors (6): 1, 2, 4, 22369, 44738, 89476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
89476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
89476 is composite. Its prime factorisation is
- 3
The divisors add up to 156590; without 89476 itself that is 67114, so 89476 is deficient (67114 is less than 89476). Euler's totient φ(89476) = 44736 numbers up to 89476 share no factor with it.
- 4
The digits of 89476 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 270 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89476 = 2^{2} \times 22369 \]89476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 156590 |
| Euler totient φ(n) | 44736 |
| Square | 8005954576 |
| Cube | 716340791642176 |
| Square root | 299.125392 (= 2√22369) |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 270 |
| Scientific notation | 8.9476 × |
89476 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand four hundred and seventy-six |
| Binary (base 2) | 10101110110000100 |
| Octal (base 8) | 256604 |
| Hexadecimal (base 16) | 15D84 |
| Base 3 | 11112201221 |
| As time | 89476 seconds = 24 h 51 min 16 s |
Is 89476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (89476 ÷ 2 = 44738) | 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 | Yes (89476 ÷ 4 = 22369) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89476 a prime number?
No. 89476 = × 22369, so it is divisible by 2.
What are the factors of 89476?
1, 2, 4, 22369, 44738, 89476.
What is 89476 in binary?
10101110110000100 (hexadecimal 15D84, octal 256604).
What is the square root of 89476?
About 299.1254, exactly 2√22369.
Is 89476 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 89476?
It is a composite number with 6 divisors.