The number 19618
19618 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 577. Divisors (8): 1, 2, 17, 34, 577, 1154, 9809, 19618.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19618 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19618 is composite. Its prime factorisation is
- 3
The divisors add up to 31212; without 19618 itself that is 11594, so 19618 is deficient (11594 is less than 19618). Euler's totient φ(19618) = 9216 numbers up to 19618 share no factor with it.
- 4
The digits of 19618 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 167 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19618 = 2 \times 17 \times 577 \]
19618 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 31212 |
| Euler totient φ(n) | 9216 |
| Square | 384865924 |
| Cube | 7550299697032 |
| Square root | 140.064271 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 167 |
| Scientific notation | 1.9618 × |
19618 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and eighteen |
| Binary (base 2) | 100110010100010 |
| Octal (base 8) | 46242 |
| Hexadecimal (base 16) | 4CA2 |
| Base 3 | 222220121 |
| As time | 19618 seconds = 5 h 26 min 58 s |
Is 19618 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19618 ÷ 2 = 9809) | 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 2) | 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 4) | 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 2) | 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 8) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19618 a prime number?
No. 19618 = 2 × 17 × 577, so it is divisible by 2.
What are the factors of 19618?
1, 2, 17, 34, 577, 1154, 9809, 19618.
What is 19618 in binary?
100110010100010 (hexadecimal 4CA2, octal 46242).
What is the square root of 19618?
About 140.0643.
Is 19618 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 19618?
It is a composite number with 8 divisors.