The number 50934
50934 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 13 × 653. Divisors (16): 1, 2, 3, 6, 13, 26, 39, 78, 653, 1306, 1959, 3918, 8489, 16978, 25467, 50934.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50934 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50934 is composite. Its prime factorisation is
- 3
The divisors add up to 109872; without 50934 itself that is 58938, so 50934 is abundant (58938 is more than 50934). Euler's totient φ(50934) = 15648 numbers up to 50934 share no factor with it.
- 4
The digits of 50934 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50934 = 2 \times 3 \times 13 \times 653 \]
50934 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 109872 |
| Euler totient φ(n) | 15648 |
| Square | 2594272356 |
| Cube | 132136668180504 |
| Square root | 225.685622 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0934 × |
50934 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and thirty-four |
| Binary (base 2) | 1100011011110110 |
| Octal (base 8) | 143366 |
| Hexadecimal (base 16) | C6F6 |
| Base 3 | 2120212110 |
| As time | 50934 seconds = 14 h 8 min 54 s |
Is 50934 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50934 ÷ 2 = 25467) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50934 ÷ 3 = 16978) | 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 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50934 ÷ 6 = 8489) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50934 a prime number?
No. 50934 = 2 × 3 × 13 × 653, so it is divisible by 2.
What are the factors of 50934?
1, 2, 3, 6, 13, 26, 39, 78, 653, 1306, 1959, 3918, 8489, 16978, 25467, 50934.
What is 50934 in binary?
1100011011110110 (hexadecimal C6F6, octal 143366).
What is the square root of 50934?
About 225.6856.
Is 50934 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50934?
It is a composite number with 16 divisors.