The number 97695
97695 is a composite number with 24 divisors. Its prime factorisation is × 5 × 13 × 167. Divisors (24): 1, 3, 5, 9, 13, 15, 39, 45, 65, 117, 167, 195, 501, 585, 835, 1503 … 97695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
97695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
97695 is composite. Its prime factorisation is
- 3
The divisors add up to 183456; without 97695 itself that is 85761, so 97695 is deficient (85761 is less than 97695). Euler's totient φ(97695) = 47808 numbers up to 97695 share no factor with it.
- 4
The digits of 97695 add up to 36, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 221 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97695 = 3^{2} \times 5 \times 13 \times 167 \]97695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 183456 |
| Euler totient φ(n) | 47808 |
| Square | 9544313025 |
| Cube | 932431660977375 |
| Square root | 312.561994 (= 3√10855) |
| Digit sum / digital root | 36 / 9 |
| Collatz steps to 1 | 221 |
| Scientific notation | 9.7695 × |
97695 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand six hundred and ninety-five |
| Binary (base 2) | 10111110110011111 |
| Octal (base 8) | 276637 |
| Hexadecimal (base 16) | 17D9F |
| Base 3 | 11222000100 |
| As time | 97695 seconds = 27 h 8 min 15 s |
Is 97695 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 (97695 ÷ 3 = 32565) | 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 (97695 ÷ 5 = 19539) | 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 | Yes (97695 ÷ 9 = 10855) | 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 4) | 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 97695 a prime number?
No. 97695 = × 5 × 13 × 167, so it is divisible by 3.
What are the factors of 97695?
1, 3, 5, 9, 13, 15, 39, 45, 65, 117, 167, 195, 501, 585, 835, 1503, 2171, 2505, 6513, 7515, 10855, 19539, 32565, 97695.
What is 97695 in binary?
10111110110011111 (hexadecimal 17D9F, octal 276637).
What is the square root of 97695?
About 312.5620, exactly 3√10855.
Is 97695 divisible by 3?
Yes. Its digits add up to 36, a multiple of 3.
What is special about the number 97695?
It is a composite number with 24 divisors.