The number 5695
5695 is a composite number with 8 divisors. Its prime factorisation is 5 × 17 × 67. Divisors (8): 1, 5, 17, 67, 85, 335, 1139, 5695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5695: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
5695 is composite. Its prime factorisation is
- 3
The divisors add up to 7344; without 5695 itself that is 1649, so 5695 is deficient (1649 is less than 5695). Euler's totient φ(5695) = 4224 numbers up to 5695 share no factor with it.
- 4
The digits of 5695 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 173 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5695 = 5 \times 17 \times 67 \]
5695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7344 |
| Euler totient φ(n) | 4224 |
| Square | 32433025 |
| Cube | 184706077375 |
| Square root | 75.465224 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 173 |
| Scientific notation | 5.695 × |
5695 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and ninety-five |
| Binary (base 2) | 1011000111111 |
| Octal (base 8) | 13077 |
| Hexadecimal (base 16) | 163F |
| Base 3 | 21210221 |
| As time | 5695 seconds = 1 h 34 min 55 s |
Is 5695 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 (5695 ÷ 5 = 1139) | 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 4) | 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 7) | 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 8) | 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 5695 a prime number?
No. 5695 = 5 × 17 × 67, so it is divisible by 5.
What are the factors of 5695?
1, 5, 17, 67, 85, 335, 1139, 5695.
What is 5695 in binary?
1011000111111 (hexadecimal 163F, octal 13077).
What is the square root of 5695?
About 75.4652.
Is 5695 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 5695?
5695 is a happy number: repeatedly adding the squares of its digits reaches 1.