The number 20902
20902 is a palindrome: it reads 20902 backwards too. Its prime factorisation is 2 × 7 × 1493. Divisors (8): 1, 2, 7, 14, 1493, 2986, 10451, 20902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20902: a palindrome: it reads 20902 backwards too.
- 2
20902 is composite. Its prime factorisation is
- 3
The divisors add up to 35856; without 20902 itself that is 14954, so 20902 is deficient (14954 is less than 20902). Euler's totient φ(20902) = 8952 numbers up to 20902 share no factor with it.
- 4
The digits of 20902 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 87 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20902 = 2 \times 7 \times 1493 \]
20902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 35856 |
| Euler totient φ(n) | 8952 |
| Square | 436893604 |
| Cube | 9131950110808 |
| Square root | 144.575240 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 87 |
| Scientific notation | 2.0902 × |
20902 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and two |
| Binary (base 2) | 101000110100110 |
| Octal (base 8) | 50646 |
| Hexadecimal (base 16) | 51A6 |
| Base 3 | 1001200011 |
| As time | 20902 seconds = 5 h 48 min 22 s |
Is 20902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20902 ÷ 2 = 10451) | 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 | Yes (20902 ÷ 7 = 2986) | 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 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 2) | 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 20902 a prime number?
No. 20902 = 2 × 7 × 1493, so it is divisible by 2.
What are the factors of 20902?
1, 2, 7, 14, 1493, 2986, 10451, 20902.
What is 20902 in binary?
101000110100110 (hexadecimal 51A6, octal 50646).
What is the square root of 20902?
About 144.5752.
Is 20902 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 20902?
20902 is a palindrome: it reads 20902 backwards too.