The number 50933
50933 is a composite number with 6 divisors. Its prime factorisation is Ć 53. Divisors (6): 1, 31, 53, 961, 1643, 50933.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50933 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50933 is composite. Its prime factorisation is
- 3
The divisors add up to 53622; without 50933 itself that is 2689, so 50933 is deficient (2689 is less than 50933). Euler's totient Ļ(50933) = 48360 numbers up to 50933 share no factor with it.
- 4
The digits of 50933 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50933 = 31^{2} \times 53 \]50933 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 53622 |
| Euler totient Ļ(n) | 48360 |
| Square | 2594170489 |
| Cube | 132128885516237 |
| Square root | 225.683407 (= 31ā53) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0933 Ć |
50933 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and thirty-three |
| Binary (base 2) | 1100011011110101 |
| Octal (base 8) | 143365 |
| Hexadecimal (base 16) | C6F5 |
| Base 3 | 2120212102 |
| As time | 50933 seconds = 14 h 8 min 53 s |
Is 50933 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 | No (remainder 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50933 a prime number?
No. 50933 = Ć 53, so it is divisible by 31.
What are the factors of 50933?
1, 31, 53, 961, 1643, 50933.
What is 50933 in binary?
1100011011110101 (hexadecimal C6F5, octal 143365).
What is the square root of 50933?
About 225.6834, exactly 31ā53.
Is 50933 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50933?
It is a composite number with 6 divisors.