The number 19519
19519 is a composite number with 4 divisors. Its prime factorisation is 131 × 149. Divisors (4): 1, 131, 149, 19519.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19519: a semiprime: 131 × 149, the product of two primes.
- 2
19519 is composite. Its prime factorisation is
- 3
The divisors add up to 19800; without 19519 itself that is 281, so 19519 is deficient (281 is less than 19519). Euler's totient φ(19519) = 19240 numbers up to 19519 share no factor with it.
- 4
The digits of 19519 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 154 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19519 = 131 \times 149 \]
19519 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19800 |
| Euler totient φ(n) | 19240 |
| Square | 380991361 |
| Cube | 7436570375359 |
| Square root | 139.710415 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 154 |
| Scientific notation | 1.9519 × |
19519 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand five hundred and nineteen |
| Binary (base 2) | 100110000111111 |
| Octal (base 8) | 46077 |
| Hexadecimal (base 16) | 4C3F |
| Base 3 | 222202221 |
| As time | 19519 seconds = 5 h 25 min 19 s |
Is 19519 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 | No (remainder 4) | 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 | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19519 a prime number?
No. 19519 = 131 × 149, so it is divisible by 131.
What are the factors of 19519?
1, 131, 149, 19519.
What is 19519 in binary?
100110000111111 (hexadecimal 4C3F, octal 46077).
What is the square root of 19519?
About 139.7104.
Is 19519 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 19519?
19519 is a semiprime: 131 × 149, the product of two primes.