The number 20098
20098 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 773. Divisors (8): 1, 2, 13, 26, 773, 1546, 10049, 20098.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20098 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20098 is composite. Its prime factorisation is
- 3
The divisors add up to 32508; without 20098 itself that is 12410, so 20098 is deficient (12410 is less than 20098). Euler's totient φ(20098) = 9264 numbers up to 20098 share no factor with it.
- 4
The digits of 20098 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20098 = 2 \times 13 \times 773 \]
20098 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 32508 |
| Euler totient φ(n) | 9264 |
| Square | 403929604 |
| Cube | 8118177181192 |
| Square root | 141.767415 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 136 |
| Scientific notation | 2.0098 × |
20098 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and ninety-eight |
| Binary (base 2) | 100111010000010 |
| Octal (base 8) | 47202 |
| Hexadecimal (base 16) | 4E82 |
| Base 3 | 1000120101 |
| As time | 20098 seconds = 5 h 34 min 58 s |
Is 20098 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20098 ÷ 2 = 10049) | 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 | No (remainder 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20098 a prime number?
No. 20098 = 2 × 13 × 773, so it is divisible by 2.
What are the factors of 20098?
1, 2, 13, 26, 773, 1546, 10049, 20098.
What is 20098 in binary?
100111010000010 (hexadecimal 4E82, octal 47202).
What is the square root of 20098?
About 141.7674.
Is 20098 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 20098?
It is a composite number with 8 divisors.