The number 19822
19822 is a composite number with 16 divisors. Its prime factorisation is 2 × 11 × 17 × 53. Divisors (16): 1, 2, 11, 17, 22, 34, 53, 106, 187, 374, 583, 901, 1166, 1802, 9911, 19822.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19822: a Harshad number: divisible by its digit sum 22.
- 2
19822 is composite. Its prime factorisation is
- 3
The divisors add up to 34992; without 19822 itself that is 15170, so 19822 is deficient (15170 is less than 19822). Euler's totient φ(19822) = 8320 numbers up to 19822 share no factor with it.
- 4
The digits of 19822 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19822 = 2 \times 11 \times 17 \times 53 \]
19822 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 34992 |
| Euler totient φ(n) | 8320 |
| Square | 392911684 |
| Cube | 7788295400248 |
| Square root | 140.790625 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 74 |
| Scientific notation | 1.9822 × |
19822 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand eight hundred and twenty-two |
| Binary (base 2) | 100110101101110 |
| Octal (base 8) | 46556 |
| Hexadecimal (base 16) | 4D6E |
| Base 3 | 1000012011 |
| As time | 19822 seconds = 5 h 30 min 22 s |
Is 19822 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19822 ÷ 2 = 9911) | 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 2) | 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 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (19822 ÷ 11 = 1802) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19822 a prime number?
No. 19822 = 2 × 11 × 17 × 53, so it is divisible by 2.
What are the factors of 19822?
1, 2, 11, 17, 22, 34, 53, 106, 187, 374, 583, 901, 1166, 1802, 9911, 19822.
What is 19822 in binary?
100110101101110 (hexadecimal 4D6E, octal 46556).
What is the square root of 19822?
About 140.7906.
Is 19822 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 19822?
19822 is a Harshad number: divisible by its digit sum 22.