The number 50141
50141 is a composite number with 16 divisors. Its prime factorisation is 7 × 13 × 19 × 29. Divisors (16): 1, 7, 13, 19, 29, 91, 133, 203, 247, 377, 551, 1729, 2639, 3857, 7163, 50141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50141 is composite. Its prime factorisation is
- 3
The divisors add up to 67200; without 50141 itself that is 17059, so 50141 is deficient (17059 is less than 50141). Euler's totient φ(50141) = 36288 numbers up to 50141 share no factor with it.
- 4
The digits of 50141 add up to 11, 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
\[ 50141 = 7 \times 13 \times 19 \times 29 \]
50141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 67200 |
| Euler totient φ(n) | 36288 |
| Square | 2514119881 |
| Cube | 126060484953221 |
| Square root | 223.921861 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0141 × |
50141 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and forty-one |
| Binary (base 2) | 1100001111011101 |
| Octal (base 8) | 141735 |
| Hexadecimal (base 16) | C3DD |
| Base 3 | 2112210002 |
| As time | 50141 seconds = 13 h 55 min 41 s |
Is 50141 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 1) | 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 | Yes (50141 ÷ 7 = 7163) | 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 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50141 a prime number?
No. 50141 = 7 × 13 × 19 × 29, so it is divisible by 7.
What are the factors of 50141?
1, 7, 13, 19, 29, 91, 133, 203, 247, 377, 551, 1729, 2639, 3857, 7163, 50141.
What is 50141 in binary?
1100001111011101 (hexadecimal C3DD, octal 141735).
What is the square root of 50141?
About 223.9219.
Is 50141 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 50141?
It is a composite number with 16 divisors.