The number 20111
20111 is a composite number with 12 divisors. Its prime factorisation is 7 × × 17. Divisors (12): 1, 7, 13, 17, 91, 119, 169, 221, 1183, 1547, 2873, 20111.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20111: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
20111 is composite. Its prime factorisation is
- 3
The divisors add up to 26352; without 20111 itself that is 6241, so 20111 is deficient (6241 is less than 20111). Euler's totient φ(20111) = 14976 numbers up to 20111 share no factor with it.
- 4
The digits of 20111 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 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20111 = 7 \times 13^{2} \times 17 \]20111 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 26352 |
| Euler totient φ(n) | 14976 |
| Square | 404452321 |
| Cube | 8133940627631 |
| Square root | 141.813257 (= 13√119) |
| Digit sum / digital root | 5 / 5 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.0111 × |
20111 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and eleven |
| Binary (base 2) | 100111010001111 |
| Octal (base 8) | 47217 |
| Hexadecimal (base 16) | 4E8F |
| Base 3 | 1000120212 |
| As time | 20111 seconds = 5 h 35 min 11 s |
Is 20111 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (20111 ÷ 7 = 2873) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20111 a prime number?
No. 20111 = 7 × × 17, so it is divisible by 7.
What are the factors of 20111?
1, 7, 13, 17, 91, 119, 169, 221, 1183, 1547, 2873, 20111.
What is 20111 in binary?
100111010001111 (hexadecimal 4E8F, octal 47217).
What is the square root of 20111?
About 141.8133, exactly 13√119.
Is 20111 divisible by 3?
No. Its digits add up to 5, which is not a multiple of 3.
What is special about the number 20111?
20111 is a happy number: repeatedly adding the squares of its digits reaches 1.