The number 20114
20114 is a composite number with 8 divisors. Its prime factorisation is 2 × 89 × 113. Divisors (8): 1, 2, 89, 113, 178, 226, 10057, 20114.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20114 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20114 is composite. Its prime factorisation is
- 3
The divisors add up to 30780; without 20114 itself that is 10666, so 20114 is deficient (10666 is less than 20114). Euler's totient φ(20114) = 9856 numbers up to 20114 share no factor with it.
- 4
The digits of 20114 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20114 = 2 \times 89 \times 113 \]
20114 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30780 |
| Euler totient φ(n) | 9856 |
| Square | 404572996 |
| Cube | 8137581241544 |
| Square root | 141.823834 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 118 |
| Scientific notation | 2.0114 × |
20114 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and fourteen |
| Binary (base 2) | 100111010010010 |
| Octal (base 8) | 47222 |
| Hexadecimal (base 16) | 4E92 |
| Base 3 | 1000120222 |
| As time | 20114 seconds = 5 h 35 min 14 s |
Is 20114 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20114 ÷ 2 = 10057) | 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 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 8) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20114 a prime number?
No. 20114 = 2 × 89 × 113, so it is divisible by 2.
What are the factors of 20114?
1, 2, 89, 113, 178, 226, 10057, 20114.
What is 20114 in binary?
100111010010010 (hexadecimal 4E92, octal 47222).
What is the square root of 20114?
About 141.8238.
Is 20114 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 20114?
It is a composite number with 8 divisors.