The number 89460
89460 is a composite number with 72 divisors. Its prime factorisation is × × 5 × 7 × 71. Divisors (72): 1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 14, 15, 18, 20, 21, 28 … 89460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
89460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
89460 is composite. Its prime factorisation is
- 3
The divisors add up to 314496; without 89460 itself that is 225036, so 89460 is abundant (225036 is more than 89460). Euler's totient φ(89460) = 20160 numbers up to 89460 share no factor with it.
- 4
The digits of 89460 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89460 = 2^{2} \times 3^{2} \times 5 \times 7 \times 71 \]89460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 72 |
| Sum of divisors | 314496 |
| Euler totient φ(n) | 20160 |
| Square | 8003091600 |
| Cube | 715956574536000 |
| Square root | 299.098646 (= 6√2485) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 8.946 × |
89460 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand four hundred and sixty |
| Binary (base 2) | 10101110101110100 |
| Octal (base 8) | 256564 |
| Hexadecimal (base 16) | 15D74 |
| Base 3 | 11112201100 |
| As time | 89460 seconds = 24 h 51 min 0 s |
Is 89460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (89460 ÷ 2 = 44730) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (89460 ÷ 3 = 29820) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (89460 ÷ 4 = 22365) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (89460 ÷ 5 = 17892) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (89460 ÷ 6 = 14910) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (89460 ÷ 7 = 12780) | 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 | Yes (89460 ÷ 9 = 9940) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (89460 ÷ 10 = 8946) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (89460 ÷ 12 = 7455) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89460 a prime number?
No. 89460 = × × 5 × 7 × 71, so it is divisible by 2.
What are the factors of 89460?
1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 14, 15, 18, 20, 21, 28, 30, 35, 36, 42, 45, 60, 63, 70, 71, 84, 90, 105, 126, 140, 142, 180, 210, 213, 252, 284, 315, 355, 420, 426, 497, 630, 639, 710, 852, 994, 1065, 1260, 1278, 1420, 1491, 1988, 2130, 2485, 2556, 2982, 3195, 4260, 4473, 4970, 5964, 6390, 7455, 8946, 9940, 12780, 14910, 17892, 22365, 29820, 44730, 89460.
What is 89460 in binary?
10101110101110100 (hexadecimal 15D74, octal 256564).
What is the square root of 89460?
About 299.0986, exactly 6√2485.
Is 89460 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 89460?
It is a composite number with 72 divisors.