The number 19597
19597 is the 2223rd prime number. Its only divisors are 1 and 19597.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19597: the 2223rd prime number.
- 2
19597 is prime, so its only factors are 1 and 19597. It is the 2223rd prime; the next prime is 19603 and the one before is 19583.
- 3
The divisors add up to 19598; without 19597 itself that is 1, so 19597 is deficient (1 is less than 19597). Euler's totient φ(19597) = 19596 numbers up to 19597 share no factor with it.
- 4
The digits of 19597 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 136 steps to reach 1.
19597 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 19598 |
| Euler totient φ(n) | 19596 |
| Square | 384042409 |
| Cube | 7526079089173 |
| Square root | 139.989285 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 136 |
| Scientific notation | 1.9597 × |
19597 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand five hundred and ninety-seven |
| Binary (base 2) | 100110010001101 |
| Octal (base 8) | 46215 |
| Hexadecimal (base 16) | 4C8D |
| Base 3 | 222212211 |
| As time | 19597 seconds = 5 h 26 min 37 s |
Is 19597 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 1) | 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 5) | 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 7) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19597 a prime number?
Yes. 19597 is divisible only by 1 and itself.
What are the factors of 19597?
1, 19597.
What is 19597 in binary?
100110010001101 (hexadecimal 4C8D, octal 46215).
What is the square root of 19597?
About 139.9893.
Is 19597 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 19597?
19597 is the 2223rd prime number.