The number 56695
56695 is a composite number with 16 divisors. Its prime factorisation is 5 × 17 × 23 × 29. Divisors (16): 1, 5, 17, 23, 29, 85, 115, 145, 391, 493, 667, 1955, 2465, 3335, 11339, 56695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56695: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
56695 is composite. Its prime factorisation is
- 3
The divisors add up to 77760; without 56695 itself that is 21065, so 56695 is deficient (21065 is less than 56695). Euler's totient φ(56695) = 39424 numbers up to 56695 share no factor with it.
- 4
The digits of 56695 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56695 = 5 \times 17 \times 23 \times 29 \]
56695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 77760 |
| Euler totient φ(n) | 39424 |
| Square | 3214323025 |
| Cube | 182236043902375 |
| Square root | 238.107119 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.6695 × |
56695 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand six hundred and ninety-five |
| Binary (base 2) | 1101110101110111 |
| Octal (base 8) | 156567 |
| Hexadecimal (base 16) | DD77 |
| Base 3 | 2212202211 |
| As time | 56695 seconds = 15 h 44 min 55 s |
Is 56695 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 1) | 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 (56695 ÷ 5 = 11339) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56695 a prime number?
No. 56695 = 5 × 17 × 23 × 29, so it is divisible by 5.
What are the factors of 56695?
1, 5, 17, 23, 29, 85, 115, 145, 391, 493, 667, 1955, 2465, 3335, 11339, 56695.
What is 56695 in binary?
1101110101110111 (hexadecimal DD77, octal 156567).
What is the square root of 56695?
About 238.1071.
Is 56695 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 56695?
56695 is a happy number: repeatedly adding the squares of its digits reaches 1.