The number 13695
13695 is a triangular number: 1 + 2 + … + 165 = 13695. Its prime factorisation is 3 × 5 × 11 × 83. Divisors (16): 1, 3, 5, 11, 15, 33, 55, 83, 165, 249, 415, 913, 1245, 2739, 4565, 13695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13695: a triangular number: 1 + 2 + … + 165 = 13695.
- 2
13695 is composite. Its prime factorisation is
- 3
The divisors add up to 24192; without 13695 itself that is 10497, so 13695 is deficient (10497 is less than 13695). Euler's totient φ(13695) = 6560 numbers up to 13695 share no factor with it.
- 4
The digits of 13695 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13695 = 3 \times 5 \times 11 \times 83 \]
13695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 24192 |
| Euler totient φ(n) | 6560 |
| Square | 187553025 |
| Cube | 2568538677375 |
| Square root | 117.025638 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.3695 × |
13695 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and ninety-five |
| Binary (base 2) | 11010101111111 |
| Octal (base 8) | 32577 |
| Hexadecimal (base 16) | 357F |
| Base 3 | 200210020 |
| As time | 13695 seconds = 3 h 48 min 15 s |
Is 13695 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 (13695 ÷ 3 = 4565) | 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 (13695 ÷ 5 = 2739) | 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 3) | 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 6) | 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 | Yes (13695 ÷ 11 = 1245) | 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 13695 a prime number?
No. 13695 = 3 × 5 × 11 × 83, so it is divisible by 3.
What are the factors of 13695?
1, 3, 5, 11, 15, 33, 55, 83, 165, 249, 415, 913, 1245, 2739, 4565, 13695.
What is 13695 in binary?
11010101111111 (hexadecimal 357F, octal 32577).
What is the square root of 13695?
About 117.0256.
Is 13695 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 13695?
13695 is a triangular number: 1 + 2 + … + 165 = 13695.