The number 20930
20930 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 7 × 13 × 23. Divisors (32): 1, 2, 5, 7, 10, 13, 14, 23, 26, 35, 46, 65, 70, 91, 115, 130 … 20930.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20930: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.
- 2
20930 is composite. Its prime factorisation is
- 3
The divisors add up to 48384; without 20930 itself that is 27454, so 20930 is abundant (27454 is more than 20930). Euler's totient φ(20930) = 6336 numbers up to 20930 share no factor with it.
- 4
The digits of 20930 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 131 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20930 = 2 \times 5 \times 7 \times 13 \times 23 \]
20930 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 48384 |
| Euler totient φ(n) | 6336 |
| Square | 438064900 |
| Cube | 9168698357000 |
| Square root | 144.672043 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 131 |
| Scientific notation | 2.093 × |
20930 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and thirty |
| Binary (base 2) | 101000111000010 |
| Octal (base 8) | 50702 |
| Hexadecimal (base 16) | 51C2 |
| Base 3 | 1001201012 |
| As time | 20930 seconds = 5 h 48 min 50 s |
Is 20930 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20930 ÷ 2 = 10465) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (20930 ÷ 5 = 4186) | 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 | Yes (20930 ÷ 7 = 2990) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (20930 ÷ 10 = 2093) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20930 a prime number?
No. 20930 = 2 × 5 × 7 × 13 × 23, so it is divisible by 2.
What are the factors of 20930?
1, 2, 5, 7, 10, 13, 14, 23, 26, 35, 46, 65, 70, 91, 115, 130, 161, 182, 230, 299, 322, 455, 598, 805, 910, 1495, 1610, 2093, 2990, 4186, 10465, 20930.
What is 20930 in binary?
101000111000010 (hexadecimal 51C2, octal 50702).
What is the square root of 20930?
About 144.6720.
Is 20930 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 20930?
20930 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.