The number 20102
20102 is a palindrome: it reads 20102 backwards too. Its prime factorisation is 2 × 19 × . Divisors (12): 1, 2, 19, 23, 38, 46, 437, 529, 874, 1058, 10051, 20102.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20102: a palindrome: it reads 20102 backwards too.
- 2
20102 is composite. Its prime factorisation is
- 3
The divisors add up to 33180; without 20102 itself that is 13078, so 20102 is deficient (13078 is less than 20102). Euler's totient φ(20102) = 9108 numbers up to 20102 share no factor with it.
- 4
The digits of 20102 add up to 5, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20102 = 2 \times 19 \times 23^{2} \]20102 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 33180 |
| Euler totient φ(n) | 9108 |
| Square | 404090404 |
| Cube | 8123025301208 |
| Square root | 141.781522 (= 23√38) |
| Digit sum / digital root | 5 / 5 |
| Collatz steps to 1 | 118 |
| Scientific notation | 2.0102 × |
20102 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and two |
| Binary (base 2) | 100111010000110 |
| Octal (base 8) | 47206 |
| Hexadecimal (base 16) | 4E86 |
| Base 3 | 1000120112 |
| As time | 20102 seconds = 5 h 35 min 2 s |
Is 20102 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20102 ÷ 2 = 10051) | 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 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 5) | 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 20102 a prime number?
No. 20102 = 2 × 19 × , so it is divisible by 2.
What are the factors of 20102?
1, 2, 19, 23, 38, 46, 437, 529, 874, 1058, 10051, 20102.
What is 20102 in binary?
100111010000110 (hexadecimal 4E86, octal 47206).
What is the square root of 20102?
About 141.7815, exactly 23√38.
Is 20102 divisible by 3?
No. Its digits add up to 5, which is not a multiple of 3.
What is special about the number 20102?
20102 is a palindrome: it reads 20102 backwards too.