The number 20130
20130 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 11 × 61. Divisors (32): 1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 55, 61, 66, 110, 122 … 20130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20130: a Harshad number: divisible by its digit sum 6.
- 2
20130 is composite. Its prime factorisation is
- 3
The divisors add up to 53568; without 20130 itself that is 33438, so 20130 is abundant (33438 is more than 20130). Euler's totient φ(20130) = 4800 numbers up to 20130 share no factor with it.
- 4
The digits of 20130 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
\[ 20130 = 2 \times 3 \times 5 \times 11 \times 61 \]
20130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 53568 |
| Euler totient φ(n) | 4800 |
| Square | 405216900 |
| Cube | 8157016197000 |
| Square root | 141.880231 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 43 |
| Scientific notation | 2.013 × |
20130 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and thirty |
| Binary (base 2) | 100111010100010 |
| Octal (base 8) | 47242 |
| Hexadecimal (base 16) | 4EA2 |
| Base 3 | 1000121120 |
| As time | 20130 seconds = 5 h 35 min 30 s |
Is 20130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20130 ÷ 2 = 10065) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (20130 ÷ 3 = 6710) | 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 | Yes (20130 ÷ 5 = 4026) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (20130 ÷ 6 = 3355) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | 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 | Yes (20130 ÷ 10 = 2013) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (20130 ÷ 11 = 1830) | 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 20130 a prime number?
No. 20130 = 2 × 3 × 5 × 11 × 61, so it is divisible by 2.
What are the factors of 20130?
1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 55, 61, 66, 110, 122, 165, 183, 305, 330, 366, 610, 671, 915, 1342, 1830, 2013, 3355, 4026, 6710, 10065, 20130.
What is 20130 in binary?
100111010100010 (hexadecimal 4EA2, octal 47242).
What is the square root of 20130?
About 141.8802.
Is 20130 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 20130?
20130 is a Harshad number: divisible by its digit sum 6.