The number 61695
61695 is a composite number with 16 divisors. Its prime factorisation is × 5 × 457. Divisors (16): 1, 3, 5, 9, 15, 27, 45, 135, 457, 1371, 2285, 4113, 6855, 12339, 20565, 61695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61695: a Harshad number: divisible by its digit sum 27.
- 2
61695 is composite. Its prime factorisation is
- 3
The divisors add up to 109920; without 61695 itself that is 48225, so 61695 is deficient (48225 is less than 61695). Euler's totient φ(61695) = 32832 numbers up to 61695 share no factor with it.
- 4
The digits of 61695 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61695 = 3^{3} \times 5 \times 457 \]61695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 109920 |
| Euler totient φ(n) | 32832 |
| Square | 3806273025 |
| Cube | 234828014277375 |
| Square root | 248.384782 (= 3√6855) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 166 |
| Scientific notation | 6.1695 × |
61695 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand six hundred and ninety-five |
| Binary (base 2) | 1111000011111111 |
| Octal (base 8) | 170377 |
| Hexadecimal (base 16) | F0FF |
| Base 3 | 10010122000 |
| As time | 61695 seconds = 17 h 8 min 15 s |
Is 61695 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 (61695 ÷ 3 = 20565) | 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 (61695 ÷ 5 = 12339) | 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 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 | Yes (61695 ÷ 9 = 6855) | 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 7) | 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 61695 a prime number?
No. 61695 = × 5 × 457, so it is divisible by 3.
What are the factors of 61695?
1, 3, 5, 9, 15, 27, 45, 135, 457, 1371, 2285, 4113, 6855, 12339, 20565, 61695.
What is 61695 in binary?
1111000011111111 (hexadecimal F0FF, octal 170377).
What is the square root of 61695?
About 248.3848, exactly 3√6855.
Is 61695 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 61695?
61695 is a Harshad number: divisible by its digit sum 27.