The number 20002
20002 is a palindrome: it reads 20002 backwards too. Its prime factorisation is 2 × 73 × 137. Divisors (8): 1, 2, 73, 137, 146, 274, 10001, 20002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20002: a palindrome: it reads 20002 backwards too.
- 2
20002 is composite. Its prime factorisation is
- 3
The divisors add up to 30636; without 20002 itself that is 10634, so 20002 is deficient (10634 is less than 20002). Euler's totient φ(20002) = 9792 numbers up to 20002 share no factor with it.
- 4
The digits of 20002 add up to 4, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 180 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20002 = 2 \times 73 \times 137 \]
20002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30636 |
| Euler totient φ(n) | 9792 |
| Square | 400080004 |
| Cube | 8002400240008 |
| Square root | 141.428427 |
| Digit sum / digital root | 4 / 4 |
| Collatz steps to 1 | 180 |
| Scientific notation | 2.0002 × |
20002 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and two |
| Binary (base 2) | 100111000100010 |
| Octal (base 8) | 47042 |
| Hexadecimal (base 16) | 4E22 |
| Base 3 | 1000102211 |
| As time | 20002 seconds = 5 h 33 min 22 s |
Is 20002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20002 ÷ 2 = 10001) | 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 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 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 4) | 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 20002 a prime number?
No. 20002 = 2 × 73 × 137, so it is divisible by 2.
What are the factors of 20002?
1, 2, 73, 137, 146, 274, 10001, 20002.
What is 20002 in binary?
100111000100010 (hexadecimal 4E22, octal 47042).
What is the square root of 20002?
About 141.4284.
Is 20002 divisible by 3?
No. Its digits add up to 4, which is not a multiple of 3.
What is special about the number 20002?
20002 is a palindrome: it reads 20002 backwards too.