The number 19497
19497 is a composite number with 8 divisors. Its prime factorisation is 3 × 67 × 97. Divisors (8): 1, 3, 67, 97, 201, 291, 6499, 19497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19497 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19497 is composite. Its prime factorisation is
- 3
The divisors add up to 26656; without 19497 itself that is 7159, so 19497 is deficient (7159 is less than 19497). Euler's totient φ(19497) = 12672 numbers up to 19497 share no factor with it.
- 4
The digits of 19497 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 167 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19497 = 3 \times 67 \times 97 \]
19497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26656 |
| Euler totient φ(n) | 12672 |
| Square | 380133009 |
| Cube | 7411453276473 |
| Square root | 139.631658 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 167 |
| Scientific notation | 1.9497 × |
19497 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand four hundred and ninety-seven |
| Binary (base 2) | 100110000101001 |
| Octal (base 8) | 46051 |
| Hexadecimal (base 16) | 4C29 |
| Base 3 | 222202010 |
| As time | 19497 seconds = 5 h 24 min 57 s |
Is 19497 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 (19497 ÷ 3 = 6499) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19497 a prime number?
No. 19497 = 3 × 67 × 97, so it is divisible by 3.
What are the factors of 19497?
1, 3, 67, 97, 201, 291, 6499, 19497.
What is 19497 in binary?
100110000101001 (hexadecimal 4C29, octal 46051).
What is the square root of 19497?
About 139.6317.
Is 19497 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 19497?
It is a composite number with 8 divisors.