The number 20104
20104 is a composite number with 16 divisors. Its prime factorisation is × 7 × 359. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 359, 718, 1436, 2513, 2872, 5026, 10052, 20104.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20104: a Harshad number: divisible by its digit sum 7.
- 2
20104 is composite. Its prime factorisation is
- 3
The divisors add up to 43200; without 20104 itself that is 23096, so 20104 is abundant (23096 is more than 20104). Euler's totient φ(20104) = 8592 numbers up to 20104 share no factor with it.
- 4
The digits of 20104 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20104 = 2^{3} \times 7 \times 359 \]20104 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 43200 |
| Euler totient φ(n) | 8592 |
| Square | 404170816 |
| Cube | 8125450084864 |
| Square root | 141.788575 (= 2√5026) |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 136 |
| Scientific notation | 2.0104 × |
20104 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and four |
| Binary (base 2) | 100111010001000 |
| Octal (base 8) | 47210 |
| Hexadecimal (base 16) | 4E88 |
| Base 3 | 1000120121 |
| As time | 20104 seconds = 5 h 35 min 4 s |
Is 20104 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20104 ÷ 2 = 10052) | 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 | Yes (20104 ÷ 4 = 5026) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (20104 ÷ 7 = 2872) | 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 | Yes (20104 ÷ 8 = 2513) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20104 a prime number?
No. 20104 = × 7 × 359, so it is divisible by 2.
What are the factors of 20104?
1, 2, 4, 7, 8, 14, 28, 56, 359, 718, 1436, 2513, 2872, 5026, 10052, 20104.
What is 20104 in binary?
100111010001000 (hexadecimal 4E88, octal 47210).
What is the square root of 20104?
About 141.7886, exactly 2√5026.
Is 20104 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 20104?
20104 is a Harshad number: divisible by its digit sum 7.