The number 50937
50937 is a composite number with 4 divisors. Its prime factorisation is 3 × 16979. Divisors (4): 1, 3, 16979, 50937.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50937: a semiprime: 3 × 16979, the product of two primes.
- 2
50937 is composite. Its prime factorisation is
- 3
The divisors add up to 67920; without 50937 itself that is 16983, so 50937 is deficient (16983 is less than 50937). Euler's totient φ(50937) = 33956 numbers up to 50937 share no factor with it.
- 4
The digits of 50937 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50937 = 3 \times 16979 \]
50937 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67920 |
| Euler totient φ(n) | 33956 |
| Square | 2594577969 |
| Cube | 132160018006953 |
| Square root | 225.692268 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0937 × |
50937 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and thirty-seven |
| Binary (base 2) | 1100011011111001 |
| Octal (base 8) | 143371 |
| Hexadecimal (base 16) | C6F9 |
| Base 3 | 2120212120 |
| As time | 50937 seconds = 14 h 8 min 57 s |
Is 50937 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50937 ÷ 3 = 16979) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50937 a prime number?
No. 50937 = 3 × 16979, so it is divisible by 3.
What are the factors of 50937?
1, 3, 16979, 50937.
What is 50937 in binary?
1100011011111001 (hexadecimal C6F9, octal 143371).
What is the square root of 50937?
About 225.6923.
Is 50937 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 50937?
50937 is a semiprime: 3 × 16979, the product of two primes.