The number 19596
19596 is a composite number with 24 divisors. Its prime factorisation is × 3 × 23 × 71. Divisors (24): 1, 2, 3, 4, 6, 12, 23, 46, 69, 71, 92, 138, 142, 213, 276, 284 … 19596.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19596 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19596 is composite. Its prime factorisation is
- 3
The divisors add up to 48384; without 19596 itself that is 28788, so 19596 is abundant (28788 is more than 19596). Euler's totient φ(19596) = 6160 numbers up to 19596 share no factor with it.
- 4
The digits of 19596 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19596 = 2^{2} \times 3 \times 23 \times 71 \]19596 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 48384 |
| Euler totient φ(n) | 6160 |
| Square | 384003216 |
| Cube | 7524927020736 |
| Square root | 139.985714 (= 2√4899) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 136 |
| Scientific notation | 1.9596 × |
19596 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand five hundred and ninety-six |
| Binary (base 2) | 100110010001100 |
| Octal (base 8) | 46214 |
| Hexadecimal (base 16) | 4C8C |
| Base 3 | 222212210 |
| As time | 19596 seconds = 5 h 26 min 36 s |
Is 19596 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19596 ÷ 2 = 9798) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (19596 ÷ 3 = 6532) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (19596 ÷ 4 = 4899) | 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 | Yes (19596 ÷ 6 = 3266) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (19596 ÷ 12 = 1633) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19596 a prime number?
No. 19596 = × 3 × 23 × 71, so it is divisible by 2.
What are the factors of 19596?
1, 2, 3, 4, 6, 12, 23, 46, 69, 71, 92, 138, 142, 213, 276, 284, 426, 852, 1633, 3266, 4899, 6532, 9798, 19596.
What is 19596 in binary?
100110010001100 (hexadecimal 4C8C, octal 46214).
What is the square root of 19596?
About 139.9857, exactly 2√4899.
Is 19596 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 19596?
It is a composite number with 24 divisors.