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