The number 19494
19494 is a composite number with 24 divisors. Its prime factorisation is 2 × × . Divisors (24): 1, 2, 3, 6, 9, 18, 19, 27, 38, 54, 57, 114, 171, 342, 361, 513 … 19494.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19494: a Harshad number: divisible by its digit sum 27.
- 2
19494 is composite. Its prime factorisation is
- 3
The divisors add up to 45720; without 19494 itself that is 26226, so 19494 is abundant (26226 is more than 19494). Euler's totient φ(19494) = 6156 numbers up to 19494 share no factor with it.
- 4
The digits of 19494 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 123 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19494 = 2 \times 3^{3} \times 19^{2} \]19494 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 45720 |
| Euler totient φ(n) | 6156 |
| Square | 380016036 |
| Cube | 7408032605784 |
| Square root | 139.620915 (= 57√6) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 123 |
| Scientific notation | 1.9494 × |
19494 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand four hundred and ninety-four |
| Binary (base 2) | 100110000100110 |
| Octal (base 8) | 46046 |
| Hexadecimal (base 16) | 4C26 |
| Base 3 | 222202000 |
| As time | 19494 seconds = 5 h 24 min 54 s |
Is 19494 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19494 ÷ 2 = 9747) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (19494 ÷ 3 = 6498) | 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 | Yes (19494 ÷ 6 = 3249) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (19494 ÷ 9 = 2166) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19494 a prime number?
No. 19494 = 2 × × , so it is divisible by 2.
What are the factors of 19494?
1, 2, 3, 6, 9, 18, 19, 27, 38, 54, 57, 114, 171, 342, 361, 513, 722, 1026, 1083, 2166, 3249, 6498, 9747, 19494.
What is 19494 in binary?
100110000100110 (hexadecimal 4C26, octal 46046).
What is the square root of 19494?
About 139.6209, exactly 57√6.
Is 19494 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 19494?
19494 is a Harshad number: divisible by its digit sum 27.