The number 20670
20670 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 13 × 53. Divisors (32): 1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 53, 65, 78, 106, 130 … 20670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20670: a Harshad number: divisible by its digit sum 15.
- 2
20670 is composite. Its prime factorisation is
- 3
The divisors add up to 54432; without 20670 itself that is 33762, so 20670 is abundant (33762 is more than 20670). Euler's totient φ(20670) = 4992 numbers up to 20670 share no factor with it.
- 4
The digits of 20670 add up to 15, 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
\[ 20670 = 2 \times 3 \times 5 \times 13 \times 53 \]
20670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 54432 |
| Euler totient φ(n) | 4992 |
| Square | 427248900 |
| Cube | 8831234763000 |
| Square root | 143.770651 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 180 |
| Scientific notation | 2.067 × |
20670 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand six hundred and seventy |
| Binary (base 2) | 101000010111110 |
| Octal (base 8) | 50276 |
| Hexadecimal (base 16) | 50BE |
| Base 3 | 1001100120 |
| As time | 20670 seconds = 5 h 44 min 30 s |
Is 20670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20670 ÷ 2 = 10335) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (20670 ÷ 3 = 6890) | 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 (20670 ÷ 5 = 4134) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (20670 ÷ 6 = 3445) | 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 6) | 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 (20670 ÷ 10 = 2067) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 20670 a prime number?
No. 20670 = 2 × 3 × 5 × 13 × 53, so it is divisible by 2.
What are the factors of 20670?
1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 53, 65, 78, 106, 130, 159, 195, 265, 318, 390, 530, 689, 795, 1378, 1590, 2067, 3445, 4134, 6890, 10335, 20670.
What is 20670 in binary?
101000010111110 (hexadecimal 50BE, octal 50276).
What is the square root of 20670?
About 143.7707.
Is 20670 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 20670?
20670 is a Harshad number: divisible by its digit sum 15.