The number 50550
50550 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 337. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 337, 674, 1011, 1685 … 50550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50550: a Harshad number: divisible by its digit sum 15.
- 2
50550 is composite. Its prime factorisation is
- 3
The divisors add up to 125736; without 50550 itself that is 75186, so 50550 is abundant (75186 is more than 50550). Euler's totient φ(50550) = 13440 numbers up to 50550 share no factor with it.
- 4
The digits of 50550 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50550 = 2 \times 3 \times 5^{2} \times 337 \]50550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 125736 |
| Euler totient φ(n) | 13440 |
| Square | 2555302500 |
| Cube | 129170541375000 |
| Square root | 224.833272 (= 5√2022) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.055 × |
50550 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and fifty |
| Binary (base 2) | 1100010101110110 |
| Octal (base 8) | 142566 |
| Hexadecimal (base 16) | C576 |
| Base 3 | 2120100020 |
| As time | 50550 seconds = 14 h 2 min 30 s |
Is 50550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50550 ÷ 2 = 25275) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50550 ÷ 3 = 16850) | 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 (50550 ÷ 5 = 10110) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50550 ÷ 6 = 8425) | 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50550 ÷ 10 = 5055) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50550 a prime number?
No. 50550 = 2 × 3 × × 337, so it is divisible by 2.
What are the factors of 50550?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 337, 674, 1011, 1685, 2022, 3370, 5055, 8425, 10110, 16850, 25275, 50550.
What is 50550 in binary?
1100010101110110 (hexadecimal C576, octal 142566).
What is the square root of 50550?
About 224.8333, exactly 5√2022.
Is 50550 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50550?
50550 is a Harshad number: divisible by its digit sum 15.