The number 52635
52635 is a composite number with 24 divisors. Its prime factorisation is 3 × 5 × × 29. Divisors (24): 1, 3, 5, 11, 15, 29, 33, 55, 87, 121, 145, 165, 319, 363, 435, 605 … 52635.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52635 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52635 is composite. Its prime factorisation is
- 3
The divisors add up to 95760; without 52635 itself that is 43125, so 52635 is deficient (43125 is less than 52635). Euler's totient φ(52635) = 24640 numbers up to 52635 share no factor with it.
- 4
The digits of 52635 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52635 = 3 \times 5 \times 11^{2} \times 29 \]52635 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 95760 |
| Euler totient φ(n) | 24640 |
| Square | 2770443225 |
| Cube | 145822279147875 |
| Square root | 229.423190 (= 11√435) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.2635 × |
52635 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand six hundred and thirty-five |
| Binary (base 2) | 1100110110011011 |
| Octal (base 8) | 146633 |
| Hexadecimal (base 16) | CD9B |
| Base 3 | 2200012110 |
| As time | 52635 seconds = 14 h 37 min 15 s |
Is 52635 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 (52635 ÷ 3 = 17545) | 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 (52635 ÷ 5 = 10527) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | Yes (52635 ÷ 11 = 4785) | 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 52635 a prime number?
No. 52635 = 3 × 5 × × 29, so it is divisible by 3.
What are the factors of 52635?
1, 3, 5, 11, 15, 29, 33, 55, 87, 121, 145, 165, 319, 363, 435, 605, 957, 1595, 1815, 3509, 4785, 10527, 17545, 52635.
What is 52635 in binary?
1100110110011011 (hexadecimal CD9B, octal 146633).
What is the square root of 52635?
About 229.4232, exactly 11√435.
Is 52635 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 52635?
It is a composite number with 24 divisors.