The number 90002
90002 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 4091. Divisors (8): 1, 2, 11, 22, 4091, 8182, 45001, 90002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90002: a Harshad number: divisible by its digit sum 11.
- 2
90002 is composite. Its prime factorisation is
- 3
The divisors add up to 147312; without 90002 itself that is 57310, so 90002 is deficient (57310 is less than 90002). Euler's totient φ(90002) = 40900 numbers up to 90002 share no factor with it.
- 4
The digits of 90002 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90002 = 2 \times 11 \times 4091 \]
90002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 147312 |
| Euler totient φ(n) | 40900 |
| Square | 8100360004 |
| Cube | 729048601080008 |
| Square root | 300.003333 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0002 × |
90002 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand and two |
| Binary (base 2) | 10101111110010010 |
| Octal (base 8) | 257622 |
| Hexadecimal (base 16) | 15F92 |
| Base 3 | 11120110102 |
| As time | 90002 seconds = 25 h 0 min 2 s |
Is 90002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90002 ÷ 2 = 45001) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 2) | 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 | Yes (90002 ÷ 11 = 8182) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90002 a prime number?
No. 90002 = 2 × 11 × 4091, so it is divisible by 2.
What are the factors of 90002?
1, 2, 11, 22, 4091, 8182, 45001, 90002.
What is 90002 in binary?
10101111110010010 (hexadecimal 15F92, octal 257622).
What is the square root of 90002?
About 300.0033.
Is 90002 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 90002?
90002 is a Harshad number: divisible by its digit sum 11.