The number 50341
50341 is the 5167th prime number. Its only divisors are 1 and 50341.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50341: the 5167th prime number.
- 2
50341 is prime, so its only factors are 1 and 50341. It is the 5167th prime; the next prime is 50359 and the one before is 50333.
- 3
The divisors add up to 50342; without 50341 itself that is 1, so 50341 is deficient (1 is less than 50341). Euler's totient φ(50341) = 50340 numbers up to 50341 share no factor with it.
- 4
The digits of 50341 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
50341 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 50342 |
| Euler totient φ(n) | 50340 |
| Square | 2534216281 |
| Cube | 127574981801821 |
| Square root | 224.368001 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0341 × |
50341 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and forty-one |
| Binary (base 2) | 1100010010100101 |
| Octal (base 8) | 142245 |
| Hexadecimal (base 16) | C4A5 |
| Base 3 | 2120001111 |
| As time | 50341 seconds = 13 h 59 min 1 s |
Is 50341 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 4) | 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 4) | 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 5) | 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 50341 a prime number?
Yes. 50341 is divisible only by 1 and itself.
What are the factors of 50341?
1, 50341.
What is 50341 in binary?
1100010010100101 (hexadecimal C4A5, octal 142245).
What is the square root of 50341?
About 224.3680.
Is 50341 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50341?
50341 is the 5167th prime number.