The number 20690
20690 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 2069. Divisors (8): 1, 2, 5, 10, 2069, 4138, 10345, 20690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20690 is composite. Its prime factorisation is
- 3
The divisors add up to 37260; without 20690 itself that is 16570, so 20690 is deficient (16570 is less than 20690). Euler's totient φ(20690) = 8272 numbers up to 20690 share no factor with it.
- 4
The digits of 20690 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 149 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20690 = 2 \times 5 \times 2069 \]
20690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 37260 |
| Euler totient φ(n) | 8272 |
| Square | 428076100 |
| Cube | 8856894509000 |
| Square root | 143.840189 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 149 |
| Scientific notation | 2.069 × |
20690 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand six hundred and ninety |
| Binary (base 2) | 101000011010010 |
| Octal (base 8) | 50322 |
| Hexadecimal (base 16) | 50D2 |
| Base 3 | 1001101022 |
| As time | 20690 seconds = 5 h 44 min 50 s |
Is 20690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20690 ÷ 2 = 10345) | 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 (20690 ÷ 5 = 4138) | 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 | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (20690 ÷ 10 = 2069) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 20690 a prime number?
No. 20690 = 2 × 5 × 2069, so it is divisible by 2.
What are the factors of 20690?
1, 2, 5, 10, 2069, 4138, 10345, 20690.
What is 20690 in binary?
101000011010010 (hexadecimal 50D2, octal 50322).
What is the square root of 20690?
About 143.8402.
Is 20690 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 20690?
It is a composite number with 8 divisors.