The number 19695
19695 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 13 × 101. Divisors (16): 1, 3, 5, 13, 15, 39, 65, 101, 195, 303, 505, 1313, 1515, 3939, 6565, 19695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19695 is composite. Its prime factorisation is
- 3
The divisors add up to 34272; without 19695 itself that is 14577, so 19695 is deficient (14577 is less than 19695). Euler's totient φ(19695) = 9600 numbers up to 19695 share no factor with it.
- 4
The digits of 19695 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 105 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19695 = 3 \times 5 \times 13 \times 101 \]
19695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 34272 |
| Euler totient φ(n) | 9600 |
| Square | 387893025 |
| Cube | 7639553127375 |
| Square root | 140.338876 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 105 |
| Scientific notation | 1.9695 × |
19695 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and ninety-five |
| Binary (base 2) | 100110011101111 |
| Octal (base 8) | 46357 |
| Hexadecimal (base 16) | 4CEF |
| Base 3 | 1000000110 |
| As time | 19695 seconds = 5 h 28 min 15 s |
Is 19695 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 | Yes (19695 ÷ 3 = 6565) | 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 (19695 ÷ 5 = 3939) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19695 a prime number?
No. 19695 = 3 × 5 × 13 × 101, so it is divisible by 3.
What are the factors of 19695?
1, 3, 5, 13, 15, 39, 65, 101, 195, 303, 505, 1313, 1515, 3939, 6565, 19695.
What is 19695 in binary?
100110011101111 (hexadecimal 4CEF, octal 46357).
What is the square root of 19695?
About 140.3389.
Is 19695 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 19695?
It is a composite number with 16 divisors.