The number 52695
52695 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1171. Divisors (12): 1, 3, 5, 9, 15, 45, 1171, 3513, 5855, 10539, 17565, 52695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52695 is composite. Its prime factorisation is
- 3
The divisors add up to 91416; without 52695 itself that is 38721, so 52695 is deficient (38721 is less than 52695). Euler's totient φ(52695) = 28080 numbers up to 52695 share no factor with it.
- 4
The digits of 52695 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52695 = 3^{2} \times 5 \times 1171 \]52695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91416 |
| Euler totient φ(n) | 28080 |
| Square | 2776763025 |
| Cube | 146321527602375 |
| Square root | 229.553915 (= 3√5855) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.2695 × |
52695 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand six hundred and ninety-five |
| Binary (base 2) | 1100110111010111 |
| Octal (base 8) | 146727 |
| Hexadecimal (base 16) | CDD7 |
| Base 3 | 2200021200 |
| As time | 52695 seconds = 14 h 38 min 15 s |
Is 52695 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 (52695 ÷ 3 = 17565) | 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 (52695 ÷ 5 = 10539) | 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 6) | 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 (52695 ÷ 9 = 5855) | 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 5) | 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 52695 a prime number?
No. 52695 = × 5 × 1171, so it is divisible by 3.
What are the factors of 52695?
1, 3, 5, 9, 15, 45, 1171, 3513, 5855, 10539, 17565, 52695.
What is 52695 in binary?
1100110111010111 (hexadecimal CDD7, octal 146727).
What is the square root of 52695?
About 229.5539, exactly 3√5855.
Is 52695 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 52695?
It is a composite number with 12 divisors.