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