The number 57695
57695 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 1049. Divisors (8): 1, 5, 11, 55, 1049, 5245, 11539, 57695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57695 is composite. Its prime factorisation is
- 3
The divisors add up to 75600; without 57695 itself that is 17905, so 57695 is deficient (17905 is less than 57695). Euler's totient φ(57695) = 41920 numbers up to 57695 share no factor with it.
- 4
The digits of 57695 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57695 = 5 \times 11 \times 1049 \]
57695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75600 |
| Euler totient φ(n) | 41920 |
| Square | 3328713025 |
| Cube | 192050097977375 |
| Square root | 240.197835 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.7695 × |
57695 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand six hundred and ninety-five |
| Binary (base 2) | 1110000101011111 |
| Octal (base 8) | 160537 |
| Hexadecimal (base 16) | E15F |
| Base 3 | 2221010212 |
| As time | 57695 seconds = 16 h 1 min 35 s |
Is 57695 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 (57695 ÷ 5 = 11539) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 (57695 ÷ 11 = 5245) | 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 57695 a prime number?
No. 57695 = 5 × 11 × 1049, so it is divisible by 5.
What are the factors of 57695?
1, 5, 11, 55, 1049, 5245, 11539, 57695.
What is 57695 in binary?
1110000101011111 (hexadecimal E15F, octal 160537).
What is the square root of 57695?
About 240.1978.
Is 57695 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 57695?
It is a composite number with 8 divisors.