The number 19996
19996 is a composite number with 6 divisors. Its prime factorisation is × 4999. Divisors (6): 1, 2, 4, 4999, 9998, 19996.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19996: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
19996 is composite. Its prime factorisation is
- 3
The divisors add up to 35000; without 19996 itself that is 15004, so 19996 is deficient (15004 is less than 19996). Euler's totient φ(19996) = 9996 numbers up to 19996 share no factor with it.
- 4
The digits of 19996 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19996 = 2^{2} \times 4999 \]19996 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 35000 |
| Euler totient φ(n) | 9996 |
| Square | 399840016 |
| Cube | 7995200959936 |
| Square root | 141.407213 (= 2√4999) |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 92 |
| Scientific notation | 1.9996 × |
19996 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand nine hundred and ninety-six |
| Binary (base 2) | 100111000011100 |
| Octal (base 8) | 47034 |
| Hexadecimal (base 16) | 4E1C |
| Base 3 | 1000102121 |
| As time | 19996 seconds = 5 h 33 min 16 s |
Is 19996 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19996 ÷ 2 = 9998) | 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 (19996 ÷ 4 = 4999) | 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 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 9) | 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 19996 a prime number?
No. 19996 = × 4999, so it is divisible by 2.
What are the factors of 19996?
1, 2, 4, 4999, 9998, 19996.
What is 19996 in binary?
100111000011100 (hexadecimal 4E1C, octal 47034).
What is the square root of 19996?
About 141.4072, exactly 2√4999.
Is 19996 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 19996?
19996 is a happy number: repeatedly adding the squares of its digits reaches 1.