The number 19696
19696 is a composite number with 10 divisors. Its prime factorisation is × 1231. Divisors (10): 1, 2, 4, 8, 16, 1231, 2462, 4924, 9848, 19696.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19696 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19696 is composite. Its prime factorisation is
- 3
The divisors add up to 38192; without 19696 itself that is 18496, so 19696 is deficient (18496 is less than 19696). Euler's totient φ(19696) = 9840 numbers up to 19696 share no factor with it.
- 4
The digits of 19696 add up to 31, 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
\[ 19696 = 2^{4} \times 1231 \]19696 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 38192 |
| Euler totient φ(n) | 9840 |
| Square | 387932416 |
| Cube | 7640716865536 |
| Square root | 140.342438 (= 4√1231) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 74 |
| Scientific notation | 1.9696 × |
19696 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and ninety-six |
| Binary (base 2) | 100110011110000 |
| Octal (base 8) | 46360 |
| Hexadecimal (base 16) | 4CF0 |
| Base 3 | 1000000111 |
| As time | 19696 seconds = 5 h 28 min 16 s |
Is 19696 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19696 ÷ 2 = 9848) | 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 | Yes (19696 ÷ 4 = 4924) | 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 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 | Yes (19696 ÷ 8 = 2462) | 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 6) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19696 a prime number?
No. 19696 = × 1231, so it is divisible by 2.
What are the factors of 19696?
1, 2, 4, 8, 16, 1231, 2462, 4924, 9848, 19696.
What is 19696 in binary?
100110011110000 (hexadecimal 4CF0, octal 46360).
What is the square root of 19696?
About 140.3424, exactly 4√1231.
Is 19696 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 19696?
It is a composite number with 10 divisors.