The number 20197
20197 is a composite number with 4 divisors. Its prime factorisation is 19 × 1063. Divisors (4): 1, 19, 1063, 20197.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20197: a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 1063, the product of two primes.
- 2
20197 is composite. Its prime factorisation is
- 3
The divisors add up to 21280; without 20197 itself that is 1083, so 20197 is deficient (1083 is less than 20197). Euler's totient φ(20197) = 19116 numbers up to 20197 share no factor with it.
- 4
The digits of 20197 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 87 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20197 = 19 \times 1063 \]
20197 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21280 |
| Euler totient φ(n) | 19116 |
| Square | 407918809 |
| Cube | 8238736185373 |
| Square root | 142.116150 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 87 |
| Scientific notation | 2.0197 × |
20197 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and ninety-seven |
| Binary (base 2) | 100111011100101 |
| Octal (base 8) | 47345 |
| Hexadecimal (base 16) | 4EE5 |
| Base 3 | 1000201001 |
| As time | 20197 seconds = 5 h 36 min 37 s |
Is 20197 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 2) | 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 5) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20197 a prime number?
No. 20197 = 19 × 1063, so it is divisible by 19.
What are the factors of 20197?
1, 19, 1063, 20197.
What is 20197 in binary?
100111011100101 (hexadecimal 4EE5, octal 47345).
What is the square root of 20197?
About 142.1161.
Is 20197 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 20197?
20197 is a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 1063, the product of two primes.