The number 20013
20013 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 953. Divisors (8): 1, 3, 7, 21, 953, 2859, 6671, 20013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20013 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20013 is composite. Its prime factorisation is
- 3
The divisors add up to 30528; without 20013 itself that is 10515, so 20013 is deficient (10515 is less than 20013). Euler's totient φ(20013) = 11424 numbers up to 20013 share no factor with it.
- 4
The digits of 20013 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 180 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20013 = 3 \times 7 \times 953 \]
20013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30528 |
| Euler totient φ(n) | 11424 |
| Square | 400520169 |
| Cube | 8015610142197 |
| Square root | 141.467311 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 180 |
| Scientific notation | 2.0013 × |
20013 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and thirteen |
| Binary (base 2) | 100111000101101 |
| Octal (base 8) | 47055 |
| Hexadecimal (base 16) | 4E2D |
| Base 3 | 1000110020 |
| As time | 20013 seconds = 5 h 33 min 33 s |
Is 20013 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 | Yes (20013 ÷ 3 = 6671) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (20013 ÷ 7 = 2859) | 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 5) | 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 3) | 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 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20013 a prime number?
No. 20013 = 3 × 7 × 953, so it is divisible by 3.
What are the factors of 20013?
1, 3, 7, 21, 953, 2859, 6671, 20013.
What is 20013 in binary?
100111000101101 (hexadecimal 4E2D, octal 47055).
What is the square root of 20013?
About 141.4673.
Is 20013 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 20013?
It is a composite number with 8 divisors.