The number 19613
19613 is a composite number with 4 divisors. Its prime factorisation is 11 × 1783. Divisors (4): 1, 11, 1783, 19613.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19613: a semiprime: 11 × 1783, the product of two primes.
- 2
19613 is composite. Its prime factorisation is
- 3
The divisors add up to 21408; without 19613 itself that is 1795, so 19613 is deficient (1795 is less than 19613). Euler's totient φ(19613) = 17820 numbers up to 19613 share no factor with it.
- 4
The digits of 19613 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 105 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19613 = 11 \times 1783 \]
19613 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21408 |
| Euler totient φ(n) | 17820 |
| Square | 384669769 |
| Cube | 7544528179397 |
| Square root | 140.046421 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 105 |
| Scientific notation | 1.9613 × |
19613 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and thirteen |
| Binary (base 2) | 100110010011101 |
| Octal (base 8) | 46235 |
| Hexadecimal (base 16) | 4C9D |
| Base 3 | 222220102 |
| As time | 19613 seconds = 5 h 26 min 53 s |
Is 19613 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | Yes (19613 ÷ 11 = 1783) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19613 a prime number?
No. 19613 = 11 × 1783, so it is divisible by 11.
What are the factors of 19613?
1, 11, 1783, 19613.
What is 19613 in binary?
100110010011101 (hexadecimal 4C9D, octal 46235).
What is the square root of 19613?
About 140.0464.
Is 19613 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 19613?
19613 is a semiprime: 11 × 1783, the product of two primes.