The number 50541
50541 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 991. Divisors (8): 1, 3, 17, 51, 991, 2973, 16847, 50541.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50541 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50541 is composite. Its prime factorisation is
- 3
The divisors add up to 71424; without 50541 itself that is 20883, so 50541 is deficient (20883 is less than 50541). Euler's totient φ(50541) = 31680 numbers up to 50541 share no factor with it.
- 4
The digits of 50541 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50541 = 3 \times 17 \times 991 \]
50541 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71424 |
| Euler totient φ(n) | 31680 |
| Square | 2554392681 |
| Cube | 129101560490421 |
| Square root | 224.813256 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0541 × |
50541 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and forty-one |
| Binary (base 2) | 1100010101101101 |
| Octal (base 8) | 142555 |
| Hexadecimal (base 16) | C56D |
| Base 3 | 2120022220 |
| As time | 50541 seconds = 14 h 2 min 21 s |
Is 50541 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 | Yes (50541 ÷ 3 = 16847) | 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 3) | 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 6) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50541 a prime number?
No. 50541 = 3 × 17 × 991, so it is divisible by 3.
What are the factors of 50541?
1, 3, 17, 51, 991, 2973, 16847, 50541.
What is 50541 in binary?
1100010101101101 (hexadecimal C56D, octal 142555).
What is the square root of 50541?
About 224.8133.
Is 50541 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50541?
It is a composite number with 8 divisors.