The number 20012
20012 is a composite number with 6 divisors. Its prime factorisation is × 5003. Divisors (6): 1, 2, 4, 5003, 10006, 20012.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20012 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20012 is composite. Its prime factorisation is
- 3
The divisors add up to 35028; without 20012 itself that is 15016, so 20012 is deficient (15016 is less than 20012). Euler's totient φ(20012) = 10004 numbers up to 20012 share no factor with it.
- 4
The digits of 20012 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 180 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20012 = 2^{2} \times 5003 \]20012 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 35028 |
| Euler totient φ(n) | 10004 |
| Square | 400480144 |
| Cube | 8014408641728 |
| Square root | 141.463776 (= 2√5003) |
| Digit sum / digital root | 5 / 5 |
| Collatz steps to 1 | 180 |
| Scientific notation | 2.0012 × |
20012 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and twelve |
| Binary (base 2) | 100111000101100 |
| Octal (base 8) | 47054 |
| Hexadecimal (base 16) | 4E2C |
| Base 3 | 1000110012 |
| As time | 20012 seconds = 5 h 33 min 32 s |
Is 20012 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20012 ÷ 2 = 10006) | 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 | Yes (20012 ÷ 4 = 5003) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20012 a prime number?
No. 20012 = × 5003, so it is divisible by 2.
What are the factors of 20012?
1, 2, 4, 5003, 10006, 20012.
What is 20012 in binary?
100111000101100 (hexadecimal 4E2C, octal 47054).
What is the square root of 20012?
About 141.4638, exactly 2√5003.
Is 20012 divisible by 3?
No. Its digits add up to 5, which is not a multiple of 3.
What is special about the number 20012?
It is a composite number with 6 divisors.