The number 50381
50381 is a composite number with 4 divisors. Its prime factorisation is 83 × 607. Divisors (4): 1, 83, 607, 50381.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50381: a semiprime: 83 × 607, the product of two primes.
- 2
50381 is composite. Its prime factorisation is
- 3
The divisors add up to 51072; without 50381 itself that is 691, so 50381 is deficient (691 is less than 50381). Euler's totient φ(50381) = 49692 numbers up to 50381 share no factor with it.
- 4
The digits of 50381 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50381 = 83 \times 607 \]
50381 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51072 |
| Euler totient φ(n) | 49692 |
| Square | 2538245161 |
| Cube | 127879329456341 |
| Square root | 224.457123 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0381 × |
50381 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and eighty-one |
| Binary (base 2) | 1100010011001101 |
| Octal (base 8) | 142315 |
| Hexadecimal (base 16) | C4CD |
| Base 3 | 2120002222 |
| As time | 50381 seconds = 13 h 59 min 41 s |
Is 50381 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 | 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 8) | 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 1) | 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 50381 a prime number?
No. 50381 = 83 × 607, so it is divisible by 83.
What are the factors of 50381?
1, 83, 607, 50381.
What is 50381 in binary?
1100010011001101 (hexadecimal C4CD, octal 142315).
What is the square root of 50381?
About 224.4571.
Is 50381 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50381?
50381 is a semiprime: 83 × 607, the product of two primes.