The number 19491
19491 is a palindrome: it reads 19491 backwards too. Its prime factorisation is 3 × 73 × 89. Divisors (8): 1, 3, 73, 89, 219, 267, 6497, 19491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19491: a palindrome: it reads 19491 backwards too.
- 2
19491 is composite. Its prime factorisation is
- 3
The divisors add up to 26640; without 19491 itself that is 7149, so 19491 is deficient (7149 is less than 19491). Euler's totient φ(19491) = 12672 numbers up to 19491 share no factor with it.
- 4
The digits of 19491 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19491 = 3 \times 73 \times 89 \]
19491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26640 |
| Euler totient φ(n) | 12672 |
| Square | 379899081 |
| Cube | 7404612987771 |
| Square root | 139.610172 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 136 |
| Scientific notation | 1.9491 × |
19491 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand four hundred and ninety-one |
| Binary (base 2) | 100110000100011 |
| Octal (base 8) | 46043 |
| Hexadecimal (base 16) | 4C23 |
| Base 3 | 222201220 |
| As time | 19491 seconds = 5 h 24 min 51 s |
Is 19491 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 | Yes (19491 ÷ 3 = 6497) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19491 a prime number?
No. 19491 = 3 × 73 × 89, so it is divisible by 3.
What are the factors of 19491?
1, 3, 73, 89, 219, 267, 6497, 19491.
What is 19491 in binary?
100110000100011 (hexadecimal 4C23, octal 46043).
What is the square root of 19491?
About 139.6102.
Is 19491 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 19491?
19491 is a palindrome: it reads 19491 backwards too.