The number 20110
20110 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 2011. Divisors (8): 1, 2, 5, 10, 2011, 4022, 10055, 20110.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20110 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20110 is composite. Its prime factorisation is
- 3
The divisors add up to 36216; without 20110 itself that is 16106, so 20110 is deficient (16106 is less than 20110). Euler's totient φ(20110) = 8040 numbers up to 20110 share no factor with it.
- 4
The digits of 20110 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 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20110 = 2 \times 5 \times 2011 \]
20110 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 36216 |
| Euler totient φ(n) | 8040 |
| Square | 404412100 |
| Cube | 8132727331000 |
| Square root | 141.809732 |
| Digit sum / digital root | 4 / 4 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.011 × |
20110 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and ten |
| Binary (base 2) | 100111010001110 |
| Octal (base 8) | 47216 |
| Hexadecimal (base 16) | 4E8E |
| Base 3 | 1000120211 |
| As time | 20110 seconds = 5 h 35 min 10 s |
Is 20110 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20110 ÷ 2 = 10055) | 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 | Yes (20110 ÷ 5 = 4022) | 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 6) | 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 | Yes (20110 ÷ 10 = 2011) | 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 20110 a prime number?
No. 20110 = 2 × 5 × 2011, so it is divisible by 2.
What are the factors of 20110?
1, 2, 5, 10, 2011, 4022, 10055, 20110.
What is 20110 in binary?
100111010001110 (hexadecimal 4E8E, octal 47216).
What is the square root of 20110?
About 141.8097.
Is 20110 divisible by 3?
No. Its digits add up to 4, which is not a multiple of 3.
What is special about the number 20110?
It is a composite number with 8 divisors.