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