The number 20099
20099 is a composite number with 4 divisors. Its prime factorisation is 101 × 199. Divisors (4): 1, 101, 199, 20099.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20099: a semiprime: 101 × 199, the product of two primes.
- 2
20099 is composite. Its prime factorisation is
- 3
The divisors add up to 20400; without 20099 itself that is 301, so 20099 is deficient (301 is less than 20099). Euler's totient φ(20099) = 19800 numbers up to 20099 share no factor with it.
- 4
The digits of 20099 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20099 = 101 \times 199 \]
20099 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20400 |
| Euler totient φ(n) | 19800 |
| Square | 403969801 |
| Cube | 8119389030299 |
| Square root | 141.770942 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 136 |
| Scientific notation | 2.0099 × |
20099 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and ninety-nine |
| Binary (base 2) | 100111010000011 |
| Octal (base 8) | 47203 |
| Hexadecimal (base 16) | 4E83 |
| Base 3 | 1000120102 |
| As time | 20099 seconds = 5 h 34 min 59 s |
Is 20099 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 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20099 a prime number?
No. 20099 = 101 × 199, so it is divisible by 101.
What are the factors of 20099?
1, 101, 199, 20099.
What is 20099 in binary?
100111010000011 (hexadecimal 4E83, octal 47203).
What is the square root of 20099?
About 141.7709.
Is 20099 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 20099?
20099 is a semiprime: 101 × 199, the product of two primes.