The number 20103
20103 is a composite number with 4 divisors. Its prime factorisation is 3 × 6701. Divisors (4): 1, 3, 6701, 20103.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20103: a semiprime: 3 × 6701, the product of two primes.
- 2
20103 is composite. Its prime factorisation is
- 3
The divisors add up to 26808; without 20103 itself that is 6705, so 20103 is deficient (6705 is less than 20103). Euler's totient φ(20103) = 13400 numbers up to 20103 share no factor with it.
- 4
The digits of 20103 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20103 = 3 \times 6701 \]
20103 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 26808 |
| Euler totient φ(n) | 13400 |
| Square | 404130609 |
| Cube | 8124237632727 |
| Square root | 141.785049 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 118 |
| Scientific notation | 2.0103 × |
20103 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and three |
| Binary (base 2) | 100111010000111 |
| Octal (base 8) | 47207 |
| Hexadecimal (base 16) | 4E87 |
| Base 3 | 1000120120 |
| As time | 20103 seconds = 5 h 35 min 3 s |
Is 20103 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 (20103 ÷ 3 = 6701) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 7) | 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 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20103 a prime number?
No. 20103 = 3 × 6701, so it is divisible by 3.
What are the factors of 20103?
1, 3, 6701, 20103.
What is 20103 in binary?
100111010000111 (hexadecimal 4E87, octal 47207).
What is the square root of 20103?
About 141.7850.
Is 20103 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 20103?
20103 is a semiprime: 3 × 6701, the product of two primes.