The number 50552
50552 is a composite number with 16 divisors. Its prime factorisation is × 71 × 89. Divisors (16): 1, 2, 4, 8, 71, 89, 142, 178, 284, 356, 568, 712, 6319, 12638, 25276, 50552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50552: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50552 is composite. Its prime factorisation is
- 3
The divisors add up to 97200; without 50552 itself that is 46648, so 50552 is deficient (46648 is less than 50552). Euler's totient φ(50552) = 24640 numbers up to 50552 share no factor with it.
- 4
The digits of 50552 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 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50552 = 2^{3} \times 71 \times 89 \]50552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 97200 |
| Euler totient φ(n) | 24640 |
| Square | 2555504704 |
| Cube | 129185873796608 |
| Square root | 224.837719 (= 2√12638) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0552 × |
50552 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and fifty-two |
| Binary (base 2) | 1100010101111000 |
| Octal (base 8) | 142570 |
| Hexadecimal (base 16) | C578 |
| Base 3 | 2120100022 |
| As time | 50552 seconds = 14 h 2 min 32 s |
Is 50552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50552 ÷ 2 = 25276) | 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 | Yes (50552 ÷ 4 = 12638) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (50552 ÷ 8 = 6319) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50552 a prime number?
No. 50552 = × 71 × 89, so it is divisible by 2.
What are the factors of 50552?
1, 2, 4, 8, 71, 89, 142, 178, 284, 356, 568, 712, 6319, 12638, 25276, 50552.
What is 50552 in binary?
1100010101111000 (hexadecimal C578, octal 142570).
What is the square root of 50552?
About 224.8377, exactly 2√12638.
Is 50552 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50552?
50552 is a happy number: repeatedly adding the squares of its digits reaches 1.