The number 20092
20092 is a composite number with 6 divisors. Its prime factorisation is × 5023. Divisors (6): 1, 2, 4, 5023, 10046, 20092.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20092 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20092 is composite. Its prime factorisation is
- 3
The divisors add up to 35168; without 20092 itself that is 15076, so 20092 is deficient (15076 is less than 20092). Euler's totient φ(20092) = 10044 numbers up to 20092 share no factor with it.
- 4
The digits of 20092 add up to 13, 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
\[ 20092 = 2^{2} \times 5023 \]20092 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 35168 |
| Euler totient φ(n) | 10044 |
| Square | 403688464 |
| Cube | 8110908618688 |
| Square root | 141.746252 (= 2√5023) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.0092 × |
20092 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and ninety-two |
| Binary (base 2) | 100111001111100 |
| Octal (base 8) | 47174 |
| Hexadecimal (base 16) | 4E7C |
| Base 3 | 1000120011 |
| As time | 20092 seconds = 5 h 34 min 52 s |
Is 20092 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20092 ÷ 2 = 10046) | 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 | Yes (20092 ÷ 4 = 5023) | 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 | No (remainder 4) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20092 a prime number?
No. 20092 = × 5023, so it is divisible by 2.
What are the factors of 20092?
1, 2, 4, 5023, 10046, 20092.
What is 20092 in binary?
100111001111100 (hexadecimal 4E7C, octal 47174).
What is the square root of 20092?
About 141.7463, exactly 2√5023.
Is 20092 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 20092?
It is a composite number with 6 divisors.