The number 51695
51695 is a composite number with 12 divisors. Its prime factorisation is 5 × × 211. Divisors (12): 1, 5, 7, 35, 49, 211, 245, 1055, 1477, 7385, 10339, 51695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51695 is composite. Its prime factorisation is
- 3
The divisors add up to 72504; without 51695 itself that is 20809, so 51695 is deficient (20809 is less than 51695). Euler's totient φ(51695) = 35280 numbers up to 51695 share no factor with it.
- 4
The digits of 51695 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51695 = 5 \times 7^{2} \times 211 \]51695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 72504 |
| Euler totient φ(n) | 35280 |
| Square | 2672373025 |
| Cube | 138148323527375 |
| Square root | 227.365345 (= 7√1055) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.1695 × |
51695 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and ninety-five |
| Binary (base 2) | 1100100111101111 |
| Octal (base 8) | 144757 |
| Hexadecimal (base 16) | C9EF |
| Base 3 | 2121220122 |
| As time | 51695 seconds = 14 h 21 min 35 s |
Is 51695 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 (51695 ÷ 5 = 10339) | 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 | Yes (51695 ÷ 7 = 7385) | 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 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 6) | 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 51695 a prime number?
No. 51695 = 5 × × 211, so it is divisible by 5.
What are the factors of 51695?
1, 5, 7, 35, 49, 211, 245, 1055, 1477, 7385, 10339, 51695.
What is 51695 in binary?
1100100111101111 (hexadecimal C9EF, octal 144757).
What is the square root of 51695?
About 227.3653, exactly 7√1055.
Is 51695 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 51695?
It is a composite number with 12 divisors.