The number 20126
20126 is a composite number with 8 divisors. Its prime factorisation is 2 × 29 × 347. Divisors (8): 1, 2, 29, 58, 347, 694, 10063, 20126.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20126 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20126 is composite. Its prime factorisation is
- 3
The divisors add up to 31320; without 20126 itself that is 11194, so 20126 is deficient (11194 is less than 20126). Euler's totient φ(20126) = 9688 numbers up to 20126 share no factor with it.
- 4
The digits of 20126 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20126 = 2 \times 29 \times 347 \]
20126 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 31320 |
| Euler totient φ(n) | 9688 |
| Square | 405055876 |
| Cube | 8152154560376 |
| Square root | 141.866134 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 118 |
| Scientific notation | 2.0126 × |
20126 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and twenty-six |
| Binary (base 2) | 100111010011110 |
| Octal (base 8) | 47236 |
| Hexadecimal (base 16) | 4E9E |
| Base 3 | 1000121102 |
| As time | 20126 seconds = 5 h 35 min 26 s |
Is 20126 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20126 ÷ 2 = 10063) | 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 1) | 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 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 6) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 20126 a prime number?
No. 20126 = 2 × 29 × 347, so it is divisible by 2.
What are the factors of 20126?
1, 2, 29, 58, 347, 694, 10063, 20126.
What is 20126 in binary?
100111010011110 (hexadecimal 4E9E, octal 47236).
What is the square root of 20126?
About 141.8661.
Is 20126 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 20126?
It is a composite number with 8 divisors.