The number 20109
20109 is a composite number with 4 divisors. Its prime factorisation is 3 × 6703. Divisors (4): 1, 3, 6703, 20109.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20109: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 6703, the product of two primes.
- 2
20109 is composite. Its prime factorisation is
- 3
The divisors add up to 26816; without 20109 itself that is 6707, so 20109 is deficient (6707 is less than 20109). Euler's totient φ(20109) = 13404 numbers up to 20109 share no factor with it.
- 4
The digits of 20109 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20109 = 3 \times 6703 \]
20109 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 26816 |
| Euler totient φ(n) | 13404 |
| Square | 404371881 |
| Cube | 8131514155029 |
| Square root | 141.806206 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 136 |
| Scientific notation | 2.0109 × |
20109 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and nine |
| Binary (base 2) | 100111010001101 |
| Octal (base 8) | 47215 |
| Hexadecimal (base 16) | 4E8D |
| Base 3 | 1000120210 |
| As time | 20109 seconds = 5 h 35 min 9 s |
Is 20109 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 | Yes (20109 ÷ 3 = 6703) | 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 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20109 a prime number?
No. 20109 = 3 × 6703, so it is divisible by 3.
What are the factors of 20109?
1, 3, 6703, 20109.
What is 20109 in binary?
100111010001101 (hexadecimal 4E8D, octal 47215).
What is the square root of 20109?
About 141.8062.
Is 20109 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 20109?
20109 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 6703, the product of two primes.