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