The number 19685
19685 is a composite number with 8 divisors. Its prime factorisation is 5 × 31 × 127. Divisors (8): 1, 5, 31, 127, 155, 635, 3937, 19685.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19685 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19685 is composite. Its prime factorisation is
- 3
The divisors add up to 24576; without 19685 itself that is 4891, so 19685 is deficient (4891 is less than 19685). Euler's totient φ(19685) = 15120 numbers up to 19685 share no factor with it.
- 4
The digits of 19685 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19685 = 5 \times 31 \times 127 \]
19685 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24576 |
| Euler totient φ(n) | 15120 |
| Square | 387499225 |
| Cube | 7627922244125 |
| Square root | 140.303243 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 74 |
| Scientific notation | 1.9685 × |
19685 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and eighty-five |
| Binary (base 2) | 100110011100101 |
| Octal (base 8) | 46345 |
| Hexadecimal (base 16) | 4CE5 |
| Base 3 | 1000000002 |
| As time | 19685 seconds = 5 h 28 min 5 s |
Is 19685 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 | Yes (19685 ÷ 5 = 3937) | 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 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 19685 a prime number?
No. 19685 = 5 × 31 × 127, so it is divisible by 5.
What are the factors of 19685?
1, 5, 31, 127, 155, 635, 3937, 19685.
What is 19685 in binary?
100110011100101 (hexadecimal 4CE5, octal 46345).
What is the square root of 19685?
About 140.3032.
Is 19685 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 19685?
It is a composite number with 8 divisors.