The number 50041
50041 is a composite number with 4 divisors. Its prime factorisation is 163 × 307. Divisors (4): 1, 163, 307, 50041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50041: a semiprime: 163 × 307, the product of two primes.
- 2
50041 is composite. Its prime factorisation is
- 3
The divisors add up to 50512; without 50041 itself that is 471, so 50041 is deficient (471 is less than 50041). Euler's totient φ(50041) = 49572 numbers up to 50041 share no factor with it.
- 4
The digits of 50041 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 233 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50041 = 163 \times 307 \]
50041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50512 |
| Euler totient φ(n) | 49572 |
| Square | 2504101681 |
| Cube | 125307752218921 |
| Square root | 223.698458 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 233 |
| Scientific notation | 5.0041 × |
50041 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and forty-one |
| Binary (base 2) | 1100001101111001 |
| Octal (base 8) | 141571 |
| Hexadecimal (base 16) | C379 |
| Base 3 | 2112122101 |
| As time | 50041 seconds = 13 h 54 min 1 s |
Is 50041 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 5) | 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 1) | 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 | No (remainder 2) | 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 50041 a prime number?
No. 50041 = 163 × 307, so it is divisible by 163.
What are the factors of 50041?
1, 163, 307, 50041.
What is 50041 in binary?
1100001101111001 (hexadecimal C379, octal 141571).
What is the square root of 50041?
About 223.6985.
Is 50041 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 50041?
50041 is a semiprime: 163 × 307, the product of two primes.