The number 10695
10695 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 23 × 31. Divisors (16): 1, 3, 5, 15, 23, 31, 69, 93, 115, 155, 345, 465, 713, 2139, 3565, 10695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10695 is composite. Its prime factorisation is
- 3
The divisors add up to 18432; without 10695 itself that is 7737, so 10695 is deficient (7737 is less than 10695). Euler's totient φ(10695) = 5280 numbers up to 10695 share no factor with it.
- 4
The digits of 10695 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10695 = 3 \times 5 \times 23 \times 31 \]
10695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 18432 |
| Euler totient φ(n) | 5280 |
| Square | 114383025 |
| Cube | 1223326452375 |
| Square root | 103.416633 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 73 |
| Scientific notation | 1.0695 × |
10695 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and ninety-five |
| Binary (base 2) | 10100111000111 |
| Octal (base 8) | 24707 |
| Hexadecimal (base 16) | 29C7 |
| Base 3 | 112200010 |
| As time | 10695 seconds = 2 h 58 min 15 s |
Is 10695 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 (10695 ÷ 3 = 3565) | 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 (10695 ÷ 5 = 2139) | 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 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 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 3) | 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 10695 a prime number?
No. 10695 = 3 × 5 × 23 × 31, so it is divisible by 3.
What are the factors of 10695?
1, 3, 5, 15, 23, 31, 69, 93, 115, 155, 345, 465, 713, 2139, 3565, 10695.
What is 10695 in binary?
10100111000111 (hexadecimal 29C7, octal 24707).
What is the square root of 10695?
About 103.4166.
Is 10695 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 10695?
It is a composite number with 16 divisors.