The number 20119
20119 is a composite number with 8 divisors. Its prime factorisation is 11 × 31 × 59. Divisors (8): 1, 11, 31, 59, 341, 649, 1829, 20119.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20119 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20119 is composite. Its prime factorisation is
- 3
The divisors add up to 23040; without 20119 itself that is 2921, so 20119 is deficient (2921 is less than 20119). Euler's totient φ(20119) = 17400 numbers up to 20119 share no factor with it.
- 4
The digits of 20119 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20119 = 11 \times 31 \times 59 \]
20119 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23040 |
| Euler totient φ(n) | 17400 |
| Square | 404774161 |
| Cube | 8143651345159 |
| Square root | 141.841461 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 136 |
| Scientific notation | 2.0119 × |
20119 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and nineteen |
| Binary (base 2) | 100111010010111 |
| Octal (base 8) | 47227 |
| Hexadecimal (base 16) | 4E97 |
| Base 3 | 1000121011 |
| As time | 20119 seconds = 5 h 35 min 19 s |
Is 20119 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 1) | 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 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | Yes (20119 ÷ 11 = 1829) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20119 a prime number?
No. 20119 = 11 × 31 × 59, so it is divisible by 11.
What are the factors of 20119?
1, 11, 31, 59, 341, 649, 1829, 20119.
What is 20119 in binary?
100111010010111 (hexadecimal 4E97, octal 47227).
What is the square root of 20119?
About 141.8415.
Is 20119 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 20119?
It is a composite number with 8 divisors.