The number 89002
89002 is a composite number with 4 divisors. Its prime factorisation is 2 × 44501. Divisors (4): 1, 2, 44501, 89002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89002: a semiprime: 2 × 44501, the product of two primes.
- 2
89002 is composite. Its prime factorisation is
- 3
The divisors add up to 133506; without 89002 itself that is 44504, so 89002 is deficient (44504 is less than 89002). Euler's totient φ(89002) = 44500 numbers up to 89002 share no factor with it.
- 4
The digits of 89002 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89002 = 2 \times 44501 \]
89002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 133506 |
| Euler totient φ(n) | 44500 |
| Square | 7921356004 |
| Cube | 705016527068008 |
| Square root | 298.332030 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 8.9002 × |
89002 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand and two |
| Binary (base 2) | 10101101110101010 |
| Octal (base 8) | 255652 |
| Hexadecimal (base 16) | 15BAA |
| Base 3 | 11112002101 |
| As time | 89002 seconds = 24 h 43 min 22 s |
Is 89002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (89002 ÷ 2 = 44501) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89002 a prime number?
No. 89002 = 2 × 44501, so it is divisible by 2.
What are the factors of 89002?
1, 2, 44501, 89002.
What is 89002 in binary?
10101101110101010 (hexadecimal 15BAA, octal 255652).
What is the square root of 89002?
About 298.3320.
Is 89002 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 89002?
89002 is a semiprime: 2 × 44501, the product of two primes.