The number 50911
50911 is a composite number with 6 divisors. Its prime factorisation is Ć 1039. Divisors (6): 1, 7, 49, 1039, 7273, 50911.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50911 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50911 is composite. Its prime factorisation is
- 3
The divisors add up to 59280; without 50911 itself that is 8369, so 50911 is deficient (8369 is less than 50911). Euler's totient Ļ(50911) = 43596 numbers up to 50911 share no factor with it.
- 4
The digits of 50911 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50911 = 7^{2} \times 1039 \]50911 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 59280 |
| Euler totient Ļ(n) | 43596 |
| Square | 2591929921 |
| Cube | 131957744208031 |
| Square root | 225.634660 (= 7ā1039) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.0911 Ć |
50911 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and eleven |
| Binary (base 2) | 1100011011011111 |
| Octal (base 8) | 143337 |
| Hexadecimal (base 16) | C6DF |
| Base 3 | 2120211121 |
| As time | 50911 seconds = 14 h 8 min 31 s |
Is 50911 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 | No (remainder 1) | 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 | Yes (50911 Ć· 7 = 7273) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50911 a prime number?
No. 50911 = Ć 1039, so it is divisible by 7.
What are the factors of 50911?
1, 7, 49, 1039, 7273, 50911.
What is 50911 in binary?
1100011011011111 (hexadecimal C6DF, octal 143337).
What is the square root of 50911?
About 225.6347, exactly 7ā1039.
Is 50911 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50911?
It is a composite number with 6 divisors.