The number 50935
50935 is a composite number with 8 divisors. Its prime factorisation is 5 × 61 × 167. Divisors (8): 1, 5, 61, 167, 305, 835, 10187, 50935.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50935 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50935 is composite. Its prime factorisation is
- 3
The divisors add up to 62496; without 50935 itself that is 11561, so 50935 is deficient (11561 is less than 50935). Euler's totient φ(50935) = 39840 numbers up to 50935 share no factor with it.
- 4
The digits of 50935 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50935 = 5 \times 61 \times 167 \]
50935 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62496 |
| Euler totient φ(n) | 39840 |
| Square | 2594374225 |
| Cube | 132144451150375 |
| Square root | 225.687838 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0935 × |
50935 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and thirty-five |
| Binary (base 2) | 1100011011110111 |
| Octal (base 8) | 143367 |
| Hexadecimal (base 16) | C6F7 |
| Base 3 | 2120212111 |
| As time | 50935 seconds = 14 h 8 min 55 s |
Is 50935 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50935 ÷ 5 = 10187) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50935 a prime number?
No. 50935 = 5 × 61 × 167, so it is divisible by 5.
What are the factors of 50935?
1, 5, 61, 167, 305, 835, 10187, 50935.
What is 50935 in binary?
1100011011110111 (hexadecimal C6F7, octal 143367).
What is the square root of 50935?
About 225.6878.
Is 50935 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50935?
It is a composite number with 8 divisors.