The number 19598
19598 is a composite number with 8 divisors. Its prime factorisation is 2 × 41 × 239. Divisors (8): 1, 2, 41, 82, 239, 478, 9799, 19598.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19598 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19598 is composite. Its prime factorisation is
- 3
The divisors add up to 30240; without 19598 itself that is 10642, so 19598 is deficient (10642 is less than 19598). Euler's totient φ(19598) = 9520 numbers up to 19598 share no factor with it.
- 4
The digits of 19598 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 48 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19598 = 2 \times 41 \times 239 \]
19598 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30240 |
| Euler totient φ(n) | 9520 |
| Square | 384081604 |
| Cube | 7527231275192 |
| Square root | 139.992857 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 48 |
| Scientific notation | 1.9598 × |
19598 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand five hundred and ninety-eight |
| Binary (base 2) | 100110010001110 |
| Octal (base 8) | 46216 |
| Hexadecimal (base 16) | 4C8E |
| Base 3 | 222212212 |
| As time | 19598 seconds = 5 h 26 min 38 s |
Is 19598 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19598 ÷ 2 = 9799) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19598 a prime number?
No. 19598 = 2 × 41 × 239, so it is divisible by 2.
What are the factors of 19598?
1, 2, 41, 82, 239, 478, 9799, 19598.
What is 19598 in binary?
100110010001110 (hexadecimal 4C8E, octal 46216).
What is the square root of 19598?
About 139.9929.
Is 19598 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 19598?
It is a composite number with 8 divisors.