The number 19594
19594 is a composite number with 8 divisors. Its prime factorisation is 2 × 97 × 101. Divisors (8): 1, 2, 97, 101, 194, 202, 9797, 19594.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19594 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19594 is composite. Its prime factorisation is
- 3
The divisors add up to 29988; without 19594 itself that is 10394, so 19594 is deficient (10394 is less than 19594). Euler's totient φ(19594) = 9600 numbers up to 19594 share no factor with it.
- 4
The digits of 19594 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19594 = 2 \times 97 \times 101 \]
19594 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29988 |
| Euler totient φ(n) | 9600 |
| Square | 383924836 |
| Cube | 7522623236584 |
| Square root | 139.978570 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 136 |
| Scientific notation | 1.9594 × |
19594 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand five hundred and ninety-four |
| Binary (base 2) | 100110010001010 |
| Octal (base 8) | 46212 |
| Hexadecimal (base 16) | 4C8A |
| Base 3 | 222212201 |
| As time | 19594 seconds = 5 h 26 min 34 s |
Is 19594 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19594 ÷ 2 = 9797) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 1) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19594 a prime number?
No. 19594 = 2 × 97 × 101, so it is divisible by 2.
What are the factors of 19594?
1, 2, 97, 101, 194, 202, 9797, 19594.
What is 19594 in binary?
100110010001010 (hexadecimal 4C8A, octal 46212).
What is the square root of 19594?
About 139.9786.
Is 19594 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 19594?
It is a composite number with 8 divisors.