The number 97595
97595 is a composite number with 8 divisors. Its prime factorisation is 5 × 131 × 149. Divisors (8): 1, 5, 131, 149, 655, 745, 19519, 97595.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
97595 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
97595 is composite. Its prime factorisation is
- 3
The divisors add up to 118800; without 97595 itself that is 21205, so 97595 is deficient (21205 is less than 97595). Euler's totient φ(97595) = 76960 numbers up to 97595 share no factor with it.
- 4
The digits of 97595 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97595 = 5 \times 131 \times 149 \]
97595 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 118800 |
| Euler totient φ(n) | 76960 |
| Square | 9524784025 |
| Cube | 929571296919875 |
| Square root | 312.401985 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 40 |
| Scientific notation | 9.7595 × |
97595 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand five hundred and ninety-five |
| Binary (base 2) | 10111110100111011 |
| Octal (base 8) | 276473 |
| Hexadecimal (base 16) | 17D3B |
| Base 3 | 11221212122 |
| As time | 97595 seconds = 27 h 6 min 35 s |
Is 97595 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 (97595 ÷ 5 = 19519) | 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 1) | 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 3) | 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 3) | 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 97595 a prime number?
No. 97595 = 5 × 131 × 149, so it is divisible by 5.
What are the factors of 97595?
1, 5, 131, 149, 655, 745, 19519, 97595.
What is 97595 in binary?
10111110100111011 (hexadecimal 17D3B, octal 276473).
What is the square root of 97595?
About 312.4020.
Is 97595 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 97595?
It is a composite number with 8 divisors.