The number 19865
19865 is a composite number with 8 divisors. Its prime factorisation is 5 × 29 × 137. Divisors (8): 1, 5, 29, 137, 145, 685, 3973, 19865.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19865: a Harshad number: divisible by its digit sum 29.
- 2
19865 is composite. Its prime factorisation is
- 3
The divisors add up to 24840; without 19865 itself that is 4975, so 19865 is deficient (4975 is less than 19865). Euler's totient φ(19865) = 15232 numbers up to 19865 share no factor with it.
- 4
The digits of 19865 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 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19865 = 5 \times 29 \times 137 \]
19865 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24840 |
| Euler totient φ(n) | 15232 |
| Square | 394618225 |
| Cube | 7839091039625 |
| Square root | 140.943251 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 118 |
| Scientific notation | 1.9865 × |
19865 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand eight hundred and sixty-five |
| Binary (base 2) | 100110110011001 |
| Octal (base 8) | 46631 |
| Hexadecimal (base 16) | 4D99 |
| Base 3 | 1000020202 |
| As time | 19865 seconds = 5 h 31 min 5 s |
Is 19865 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 (19865 ÷ 5 = 3973) | 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 1) | 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 10) | 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 19865 a prime number?
No. 19865 = 5 × 29 × 137, so it is divisible by 5.
What are the factors of 19865?
1, 5, 29, 137, 145, 685, 3973, 19865.
What is 19865 in binary?
100110110011001 (hexadecimal 4D99, octal 46631).
What is the square root of 19865?
About 140.9433.
Is 19865 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 19865?
19865 is a Harshad number: divisible by its digit sum 29.