The number 52552
52552 is a composite number with 8 divisors. Its prime factorisation is × 6569. Divisors (8): 1, 2, 4, 8, 6569, 13138, 26276, 52552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52552 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52552 is composite. Its prime factorisation is
- 3
The divisors add up to 98550; without 52552 itself that is 45998, so 52552 is deficient (45998 is less than 52552). Euler's totient φ(52552) = 26272 numbers up to 52552 share no factor with it.
- 4
The digits of 52552 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52552 = 2^{3} \times 6569 \]52552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 98550 |
| Euler totient φ(n) | 26272 |
| Square | 2761712704 |
| Cube | 145133526020608 |
| Square root | 229.242230 (= 2√13138) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.2552 × |
52552 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and fifty-two |
| Binary (base 2) | 1100110101001000 |
| Octal (base 8) | 146510 |
| Hexadecimal (base 16) | CD48 |
| Base 3 | 2200002101 |
| As time | 52552 seconds = 14 h 35 min 52 s |
Is 52552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52552 ÷ 2 = 26276) | 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 | Yes (52552 ÷ 4 = 13138) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | Yes (52552 ÷ 8 = 6569) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52552 a prime number?
No. 52552 = × 6569, so it is divisible by 2.
What are the factors of 52552?
1, 2, 4, 8, 6569, 13138, 26276, 52552.
What is 52552 in binary?
1100110101001000 (hexadecimal CD48, octal 146510).
What is the square root of 52552?
About 229.2422, exactly 2√13138.
Is 52552 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 52552?
It is a composite number with 8 divisors.