The number 20011
20011 is the 2263rd prime number. Its only divisors are 1 and 20011.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20011: the 2263rd prime number.
- 2
20011 is prime, so its only factors are 1 and 20011. It is the 2263rd prime; the next prime is 20021 and the one before is 19997.
- 3
The divisors add up to 20012; without 20011 itself that is 1, so 20011 is deficient (1 is less than 20011). Euler's totient φ(20011) = 20010 numbers up to 20011 share no factor with it.
- 4
The digits of 20011 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.
20011 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 20012 |
| Euler totient φ(n) | 20010 |
| Square | 400440121 |
| Cube | 8013207261331 |
| Square root | 141.460242 |
| Digit sum / digital root | 4 / 4 |
| Collatz steps to 1 | 180 |
| Scientific notation | 2.0011 × |
20011 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and eleven |
| Binary (base 2) | 100111000101011 |
| Octal (base 8) | 47053 |
| Hexadecimal (base 16) | 4E2B |
| Base 3 | 1000110011 |
| As time | 20011 seconds = 5 h 33 min 31 s |
Is 20011 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 1) | 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 1) | 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 3) | 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 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20011 a prime number?
Yes. 20011 is divisible only by 1 and itself.
What are the factors of 20011?
1, 20011.
What is 20011 in binary?
100111000101011 (hexadecimal 4E2B, octal 47053).
What is the square root of 20011?
About 141.4602.
Is 20011 divisible by 3?
No. Its digits add up to 4, which is not a multiple of 3.
What is special about the number 20011?
20011 is the 2263rd prime number.