The number 89301
89301 is a composite number with 12 divisors. Its prime factorisation is 3 × × 103. Divisors (12): 1, 3, 17, 51, 103, 289, 309, 867, 1751, 5253, 29767, 89301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
89301 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
89301 is composite. Its prime factorisation is
- 3
The divisors add up to 127712; without 89301 itself that is 38411, so 89301 is deficient (38411 is less than 89301). Euler's totient φ(89301) = 55488 numbers up to 89301 share no factor with it.
- 4
The digits of 89301 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89301 = 3 \times 17^{2} \times 103 \]89301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 127712 |
| Euler totient φ(n) | 55488 |
| Square | 7974668601 |
| Cube | 712145880737901 |
| Square root | 298.832729 (= 17√309) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 8.9301 × |
89301 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand three hundred and one |
| Binary (base 2) | 10101110011010101 |
| Octal (base 8) | 256325 |
| Hexadecimal (base 16) | 15CD5 |
| Base 3 | 11112111110 |
| As time | 89301 seconds = 24 h 48 min 21 s |
Is 89301 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 (89301 ÷ 3 = 29767) | 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 | 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 5) | 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 3) | 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 89301 a prime number?
No. 89301 = 3 × × 103, so it is divisible by 3.
What are the factors of 89301?
1, 3, 17, 51, 103, 289, 309, 867, 1751, 5253, 29767, 89301.
What is 89301 in binary?
10101110011010101 (hexadecimal 15CD5, octal 256325).
What is the square root of 89301?
About 298.8327, exactly 17√309.
Is 89301 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 89301?
It is a composite number with 12 divisors.