The number 52550
52550 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1051. Divisors (12): 1, 2, 5, 10, 25, 50, 1051, 2102, 5255, 10510, 26275, 52550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52550: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
52550 is composite. Its prime factorisation is
- 3
The divisors add up to 97836; without 52550 itself that is 45286, so 52550 is deficient (45286 is less than 52550). Euler's totient φ(52550) = 21000 numbers up to 52550 share no factor with it.
- 4
The digits of 52550 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52550 = 2 \times 5^{2} \times 1051 \]52550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 97836 |
| Euler totient φ(n) | 21000 |
| Square | 2761502500 |
| Cube | 145116956375000 |
| Square root | 229.237868 (= 5√2102) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.255 × |
52550 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand five hundred and fifty |
| Binary (base 2) | 1100110101000110 |
| Octal (base 8) | 146506 |
| Hexadecimal (base 16) | CD46 |
| Base 3 | 2200002022 |
| As time | 52550 seconds = 14 h 35 min 50 s |
Is 52550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52550 ÷ 2 = 26275) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (52550 ÷ 5 = 10510) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 | Yes (52550 ÷ 10 = 5255) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52550 a prime number?
No. 52550 = 2 × × 1051, so it is divisible by 2.
What are the factors of 52550?
1, 2, 5, 10, 25, 50, 1051, 2102, 5255, 10510, 26275, 52550.
What is 52550 in binary?
1100110101000110 (hexadecimal CD46, octal 146506).
What is the square root of 52550?
About 229.2379, exactly 5√2102.
Is 52550 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 52550?
52550 is a happy number: repeatedly adding the squares of its digits reaches 1.