The number 19691
19691 is a palindrome: it reads 19691 backwards too. Its prime factorisation is 7 × 29 × 97. Divisors (8): 1, 7, 29, 97, 203, 679, 2813, 19691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19691: a palindrome: it reads 19691 backwards too.
- 2
19691 is composite. Its prime factorisation is
- 3
The divisors add up to 23520; without 19691 itself that is 3829, so 19691 is deficient (3829 is less than 19691). Euler's totient φ(19691) = 16128 numbers up to 19691 share no factor with it.
- 4
The digits of 19691 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 48 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19691 = 7 \times 29 \times 97 \]
19691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23520 |
| Euler totient φ(n) | 16128 |
| Square | 387735481 |
| Cube | 7634899356371 |
| Square root | 140.324624 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 48 |
| Scientific notation | 1.9691 × |
19691 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and ninety-one |
| Binary (base 2) | 100110011101011 |
| Octal (base 8) | 46353 |
| Hexadecimal (base 16) | 4CEB |
| Base 3 | 1000000022 |
| As time | 19691 seconds = 5 h 28 min 11 s |
Is 19691 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (19691 ÷ 7 = 2813) | 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 3) | 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 1) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19691 a prime number?
No. 19691 = 7 × 29 × 97, so it is divisible by 7.
What are the factors of 19691?
1, 7, 29, 97, 203, 679, 2813, 19691.
What is 19691 in binary?
100110011101011 (hexadecimal 4CEB, octal 46353).
What is the square root of 19691?
About 140.3246.
Is 19691 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 19691?
19691 is a palindrome: it reads 19691 backwards too.