The number 20191
20191 is a composite number with 4 divisors. Its prime factorisation is 61 × 331. Divisors (4): 1, 61, 331, 20191.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20191: a semiprime: 61 × 331, the product of two primes.
- 2
20191 is composite. Its prime factorisation is
- 3
The divisors add up to 20584; without 20191 itself that is 393, so 20191 is deficient (393 is less than 20191). Euler's totient φ(20191) = 19800 numbers up to 20191 share no factor with it.
- 4
The digits of 20191 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 149 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20191 = 61 \times 331 \]
20191 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20584 |
| Euler totient φ(n) | 19800 |
| Square | 407676481 |
| Cube | 8231395827871 |
| Square root | 142.095039 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 149 |
| Scientific notation | 2.0191 × |
20191 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and ninety-one |
| Binary (base 2) | 100111011011111 |
| Octal (base 8) | 47337 |
| Hexadecimal (base 16) | 4EDF |
| Base 3 | 1000200211 |
| As time | 20191 seconds = 5 h 36 min 31 s |
Is 20191 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 1) | 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 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 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 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20191 a prime number?
No. 20191 = 61 × 331, so it is divisible by 61.
What are the factors of 20191?
1, 61, 331, 20191.
What is 20191 in binary?
100111011011111 (hexadecimal 4EDF, octal 47337).
What is the square root of 20191?
About 142.0950.
Is 20191 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 20191?
20191 is a semiprime: 61 × 331, the product of two primes.