The number 20116
20116 is a composite number with 12 divisors. Its prime factorisation is × 47 × 107. Divisors (12): 1, 2, 4, 47, 94, 107, 188, 214, 428, 5029, 10058, 20116.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20116 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20116 is composite. Its prime factorisation is
- 3
The divisors add up to 36288; without 20116 itself that is 16172, so 20116 is deficient (16172 is less than 20116). Euler's totient φ(20116) = 9752 numbers up to 20116 share no factor with it.
- 4
The digits of 20116 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20116 = 2^{2} \times 47 \times 107 \]20116 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 36288 |
| Euler totient φ(n) | 9752 |
| Square | 404653456 |
| Cube | 8140008920896 |
| Square root | 141.830885 (= 2√5029) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 43 |
| Scientific notation | 2.0116 × |
20116 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and sixteen |
| Binary (base 2) | 100111010010100 |
| Octal (base 8) | 47224 |
| Hexadecimal (base 16) | 4E94 |
| Base 3 | 1000121001 |
| As time | 20116 seconds = 5 h 35 min 16 s |
Is 20116 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20116 ÷ 2 = 10058) | 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 | Yes (20116 ÷ 4 = 5029) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 5) | 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 4) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20116 a prime number?
No. 20116 = × 47 × 107, so it is divisible by 2.
What are the factors of 20116?
1, 2, 4, 47, 94, 107, 188, 214, 428, 5029, 10058, 20116.
What is 20116 in binary?
100111010010100 (hexadecimal 4E94, octal 47224).
What is the square root of 20116?
About 141.8309, exactly 2√5029.
Is 20116 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 20116?
It is a composite number with 12 divisors.