The number 20605
20605 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 317. Divisors (8): 1, 5, 13, 65, 317, 1585, 4121, 20605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20605: a Harshad number: divisible by its digit sum 13.
- 2
20605 is composite. Its prime factorisation is
- 3
The divisors add up to 26712; without 20605 itself that is 6107, so 20605 is deficient (6107 is less than 20605). Euler's totient φ(20605) = 15168 numbers up to 20605 share no factor with it.
- 4
The digits of 20605 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20605 = 5 \times 13 \times 317 \]
20605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26712 |
| Euler totient φ(n) | 15168 |
| Square | 424566025 |
| Cube | 8748182945125 |
| Square root | 143.544418 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.0605 × |
20605 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand six hundred and five |
| Binary (base 2) | 101000001111101 |
| Octal (base 8) | 50175 |
| Hexadecimal (base 16) | 507D |
| Base 3 | 1001021011 |
| As time | 20605 seconds = 5 h 43 min 25 s |
Is 20605 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 | No (remainder 1) | 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 | Yes (20605 ÷ 5 = 4121) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20605 a prime number?
No. 20605 = 5 × 13 × 317, so it is divisible by 5.
What are the factors of 20605?
1, 5, 13, 65, 317, 1585, 4121, 20605.
What is 20605 in binary?
101000001111101 (hexadecimal 507D, octal 50175).
What is the square root of 20605?
About 143.5444.
Is 20605 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 20605?
20605 is a Harshad number: divisible by its digit sum 13.