The number 19513
19513 is a composite number with 8 divisors. Its prime factorisation is 13 × 19 × 79. Divisors (8): 1, 13, 19, 79, 247, 1027, 1501, 19513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19513: a Harshad number: divisible by its digit sum 19.
- 2
19513 is composite. Its prime factorisation is
- 3
The divisors add up to 22400; without 19513 itself that is 2887, so 19513 is deficient (2887 is less than 19513). Euler's totient φ(19513) = 16848 numbers up to 19513 share no factor with it.
- 4
The digits of 19513 add up to 19, 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
\[ 19513 = 13 \times 19 \times 79 \]
19513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22400 |
| Euler totient φ(n) | 16848 |
| Square | 380757169 |
| Cube | 7429714638697 |
| Square root | 139.688940 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 123 |
| Scientific notation | 1.9513 × |
19513 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand five hundred and thirteen |
| Binary (base 2) | 100110000111001 |
| Octal (base 8) | 46071 |
| Hexadecimal (base 16) | 4C39 |
| Base 3 | 222202201 |
| As time | 19513 seconds = 5 h 25 min 13 s |
Is 19513 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 4) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19513 a prime number?
No. 19513 = 13 × 19 × 79, so it is divisible by 13.
What are the factors of 19513?
1, 13, 19, 79, 247, 1027, 1501, 19513.
What is 19513 in binary?
100110000111001 (hexadecimal 4C39, octal 46071).
What is the square root of 19513?
About 139.6889.
Is 19513 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 19513?
19513 is a Harshad number: divisible by its digit sum 19.