The number 19495
19495 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 557. Divisors (8): 1, 5, 7, 35, 557, 2785, 3899, 19495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19495 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19495 is composite. Its prime factorisation is
- 3
The divisors add up to 26784; without 19495 itself that is 7289, so 19495 is deficient (7289 is less than 19495). Euler's totient φ(19495) = 13344 numbers up to 19495 share no factor with it.
- 4
The digits of 19495 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 123 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19495 = 5 \times 7 \times 557 \]
19495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26784 |
| Euler totient φ(n) | 13344 |
| Square | 380055025 |
| Cube | 7409172712375 |
| Square root | 139.624496 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 123 |
| Scientific notation | 1.9495 × |
19495 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand four hundred and ninety-five |
| Binary (base 2) | 100110000100111 |
| Octal (base 8) | 46047 |
| Hexadecimal (base 16) | 4C27 |
| Base 3 | 222202001 |
| As time | 19495 seconds = 5 h 24 min 55 s |
Is 19495 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 | No (remainder 1) | 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 | Yes (19495 ÷ 5 = 3899) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (19495 ÷ 7 = 2785) | 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 7) | 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 5) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19495 a prime number?
No. 19495 = 5 × 7 × 557, so it is divisible by 5.
What are the factors of 19495?
1, 5, 7, 35, 557, 2785, 3899, 19495.
What is 19495 in binary?
100110000100111 (hexadecimal 4C27, octal 46047).
What is the square root of 19495?
About 139.6245.
Is 19495 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 19495?
It is a composite number with 8 divisors.