The number 20112
20112 is a composite number with 20 divisors. Its prime factorisation is × 3 × 419. Divisors (20): 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 419, 838, 1257, 1676, 2514, 3352 … 20112.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20112: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 6.
- 2
20112 is composite. Its prime factorisation is
- 3
The divisors add up to 52080; without 20112 itself that is 31968, so 20112 is abundant (31968 is more than 20112). Euler's totient φ(20112) = 6688 numbers up to 20112 share no factor with it.
- 4
The digits of 20112 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20112 = 2^{4} \times 3 \times 419 \]20112 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 52080 |
| Euler totient φ(n) | 6688 |
| Square | 404492544 |
| Cube | 8135154044928 |
| Square root | 141.816783 (= 4√1257) |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 43 |
| Scientific notation | 2.0112 × |
20112 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and twelve |
| Binary (base 2) | 100111010010000 |
| Octal (base 8) | 47220 |
| Hexadecimal (base 16) | 4E90 |
| Base 3 | 1000120220 |
| As time | 20112 seconds = 5 h 35 min 12 s |
Is 20112 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20112 ÷ 2 = 10056) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (20112 ÷ 3 = 6704) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (20112 ÷ 4 = 5028) | 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 | Yes (20112 ÷ 6 = 3352) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (20112 ÷ 8 = 2514) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (20112 ÷ 12 = 1676) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20112 a prime number?
No. 20112 = × 3 × 419, so it is divisible by 2.
What are the factors of 20112?
1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 419, 838, 1257, 1676, 2514, 3352, 5028, 6704, 10056, 20112.
What is 20112 in binary?
100111010010000 (hexadecimal 4E90, octal 47220).
What is the square root of 20112?
About 141.8168, exactly 4√1257.
Is 20112 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 20112?
20112 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 6.