The number 50930
50930 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 463. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 463, 926, 2315, 4630, 5093, 10186, 25465, 50930.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50930 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50930 is composite. Its prime factorisation is
- 3
The divisors add up to 100224; without 50930 itself that is 49294, so 50930 is deficient (49294 is less than 50930). Euler's totient φ(50930) = 18480 numbers up to 50930 share no factor with it.
- 4
The digits of 50930 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50930 = 2 \times 5 \times 11 \times 463 \]
50930 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 100224 |
| Euler totient φ(n) | 18480 |
| Square | 2593864900 |
| Cube | 132105539357000 |
| Square root | 225.676760 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.093 × |
50930 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and thirty |
| Binary (base 2) | 1100011011110010 |
| Octal (base 8) | 143362 |
| Hexadecimal (base 16) | C6F2 |
| Base 3 | 2120212022 |
| As time | 50930 seconds = 14 h 8 min 50 s |
Is 50930 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50930 ÷ 2 = 25465) | 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 (50930 ÷ 5 = 10186) | 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 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50930 ÷ 10 = 5093) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50930 ÷ 11 = 4630) | 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 50930 a prime number?
No. 50930 = 2 × 5 × 11 × 463, so it is divisible by 2.
What are the factors of 50930?
1, 2, 5, 10, 11, 22, 55, 110, 463, 926, 2315, 4630, 5093, 10186, 25465, 50930.
What is 50930 in binary?
1100011011110010 (hexadecimal C6F2, octal 143362).
What is the square root of 50930?
About 225.6768.
Is 50930 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50930?
It is a composite number with 16 divisors.