The number 50650
50650 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1013. Divisors (12): 1, 2, 5, 10, 25, 50, 1013, 2026, 5065, 10130, 25325, 50650.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50650: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50650 is composite. Its prime factorisation is
- 3
The divisors add up to 94302; without 50650 itself that is 43652, so 50650 is deficient (43652 is less than 50650). Euler's totient φ(50650) = 20240 numbers up to 50650 share no factor with it.
- 4
The digits of 50650 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50650 = 2 \times 5^{2} \times 1013 \]50650 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 94302 |
| Euler totient φ(n) | 20240 |
| Square | 2565422500 |
| Cube | 129938649625000 |
| Square root | 225.055549 (= 5√2026) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.065 × |
50650 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and fifty |
| Binary (base 2) | 1100010111011010 |
| Octal (base 8) | 142732 |
| Hexadecimal (base 16) | C5DA |
| Base 3 | 2120110221 |
| As time | 50650 seconds = 14 h 4 min 10 s |
Is 50650 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50650 ÷ 2 = 25325) | 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 (50650 ÷ 5 = 10130) | 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 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 | No (remainder 2) | 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 (50650 ÷ 10 = 5065) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 50650 a prime number?
No. 50650 = 2 × × 1013, so it is divisible by 2.
What are the factors of 50650?
1, 2, 5, 10, 25, 50, 1013, 2026, 5065, 10130, 25325, 50650.
What is 50650 in binary?
1100010111011010 (hexadecimal C5DA, octal 142732).
What is the square root of 50650?
About 225.0555, exactly 5√2026.
Is 50650 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50650?
50650 is a happy number: repeatedly adding the squares of its digits reaches 1.