The number 92002
92002 is a composite number with 8 divisors. Its prime factorisation is 2 × 157 × 293. Divisors (8): 1, 2, 157, 293, 314, 586, 46001, 92002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92002 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92002 is composite. Its prime factorisation is
- 3
The divisors add up to 139356; without 92002 itself that is 47354, so 92002 is deficient (47354 is less than 92002). Euler's totient φ(92002) = 45552 numbers up to 92002 share no factor with it.
- 4
The digits of 92002 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92002 = 2 \times 157 \times 293 \]
92002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 139356 |
| Euler totient φ(n) | 45552 |
| Square | 8464368004 |
| Cube | 778738785104008 |
| Square root | 303.318315 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.2002 × |
92002 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand and two |
| Binary (base 2) | 10110011101100010 |
| Octal (base 8) | 263542 |
| Hexadecimal (base 16) | 16762 |
| Base 3 | 11200012111 |
| As time | 92002 seconds = 25 h 33 min 22 s |
Is 92002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92002 ÷ 2 = 46001) | 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 1) | 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 4) | 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 9) | 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 92002 a prime number?
No. 92002 = 2 × 157 × 293, so it is divisible by 2.
What are the factors of 92002?
1, 2, 157, 293, 314, 586, 46001, 92002.
What is 92002 in binary?
10110011101100010 (hexadecimal 16762, octal 263542).
What is the square root of 92002?
About 303.3183.
Is 92002 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 92002?
It is a composite number with 8 divisors.