The number 20022
20022 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 47 × 71. Divisors (16): 1, 2, 3, 6, 47, 71, 94, 141, 142, 213, 282, 426, 3337, 6674, 10011, 20022.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20022: a Harshad number: divisible by its digit sum 6.
- 2
20022 is composite. Its prime factorisation is
- 3
The divisors add up to 41472; without 20022 itself that is 21450, so 20022 is abundant (21450 is more than 20022). Euler's totient φ(20022) = 6440 numbers up to 20022 share no factor with it.
- 4
The digits of 20022 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 211 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20022 = 2 \times 3 \times 47 \times 71 \]
20022 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 41472 |
| Euler totient φ(n) | 6440 |
| Square | 400880484 |
| Cube | 8026429050648 |
| Square root | 141.499117 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 211 |
| Scientific notation | 2.0022 × |
20022 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and twenty-two |
| Binary (base 2) | 100111000110110 |
| Octal (base 8) | 47066 |
| Hexadecimal (base 16) | 4E36 |
| Base 3 | 1000110120 |
| As time | 20022 seconds = 5 h 33 min 42 s |
Is 20022 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20022 ÷ 2 = 10011) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (20022 ÷ 3 = 6674) | 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 | Yes (20022 ÷ 6 = 3337) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20022 a prime number?
No. 20022 = 2 × 3 × 47 × 71, so it is divisible by 2.
What are the factors of 20022?
1, 2, 3, 6, 47, 71, 94, 141, 142, 213, 282, 426, 3337, 6674, 10011, 20022.
What is 20022 in binary?
100111000110110 (hexadecimal 4E36, octal 47066).
What is the square root of 20022?
About 141.4991.
Is 20022 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 20022?
20022 is a Harshad number: divisible by its digit sum 6.