The number 19682
19682 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 757. Divisors (8): 1, 2, 13, 26, 757, 1514, 9841, 19682.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19682: a Harshad number: divisible by its digit sum 26.
- 2
19682 is composite. Its prime factorisation is
- 3
The divisors add up to 31836; without 19682 itself that is 12154, so 19682 is deficient (12154 is less than 19682). Euler's totient φ(19682) = 9072 numbers up to 19682 share no factor with it.
- 4
The digits of 19682 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 43 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19682 = 2 \times 13 \times 757 \]
19682 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 31836 |
| Euler totient φ(n) | 9072 |
| Square | 387381124 |
| Cube | 7624435282568 |
| Square root | 140.292551 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 43 |
| Scientific notation | 1.9682 × |
19682 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and eighty-two |
| Binary (base 2) | 100110011100010 |
| Octal (base 8) | 46342 |
| Hexadecimal (base 16) | 4CE2 |
| Base 3 | 222222222 |
| As time | 19682 seconds = 5 h 28 min 2 s |
Is 19682 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19682 ÷ 2 = 9841) | 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 2) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | No (remainder 3) | 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 19682 a prime number?
No. 19682 = 2 × 13 × 757, so it is divisible by 2.
What are the factors of 19682?
1, 2, 13, 26, 757, 1514, 9841, 19682.
What is 19682 in binary?
100110011100010 (hexadecimal 4CE2, octal 46342).
What is the square root of 19682?
About 140.2926.
Is 19682 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 19682?
19682 is a Harshad number: divisible by its digit sum 26.