The number 51650
51650 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1033. Divisors (12): 1, 2, 5, 10, 25, 50, 1033, 2066, 5165, 10330, 25825, 51650.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51650 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51650 is composite. Its prime factorisation is
- 3
The divisors add up to 96162; without 51650 itself that is 44512, so 51650 is deficient (44512 is less than 51650). Euler's totient φ(51650) = 20640 numbers up to 51650 share no factor with it.
- 4
The digits of 51650 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51650 = 2 \times 5^{2} \times 1033 \]51650 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 96162 |
| Euler totient φ(n) | 20640 |
| Square | 2667722500 |
| Cube | 137787867125000 |
| Square root | 227.266364 (= 5√2066) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.165 × |
51650 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and fifty |
| Binary (base 2) | 1100100111000010 |
| Octal (base 8) | 144702 |
| Hexadecimal (base 16) | C9C2 |
| Base 3 | 2121211222 |
| As time | 51650 seconds = 14 h 20 min 50 s |
Is 51650 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51650 ÷ 2 = 25825) | 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 (51650 ÷ 5 = 10330) | 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 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51650 ÷ 10 = 5165) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51650 a prime number?
No. 51650 = 2 × × 1033, so it is divisible by 2.
What are the factors of 51650?
1, 2, 5, 10, 25, 50, 1033, 2066, 5165, 10330, 25825, 51650.
What is 51650 in binary?
1100100111000010 (hexadecimal C9C2, octal 144702).
What is the square root of 51650?
About 227.2664, exactly 5√2066.
Is 51650 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51650?
It is a composite number with 12 divisors.