The number 50371
50371 is a composite number with 4 divisors. Its prime factorisation is 17 × 2963. Divisors (4): 1, 17, 2963, 50371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50371: a semiprime: 17 × 2963, the product of two primes.
- 2
50371 is composite. Its prime factorisation is
- 3
The divisors add up to 53352; without 50371 itself that is 2981, so 50371 is deficient (2981 is less than 50371). Euler's totient φ(50371) = 47392 numbers up to 50371 share no factor with it.
- 4
The digits of 50371 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50371 = 17 \times 2963 \]
50371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53352 |
| Euler totient φ(n) | 47392 |
| Square | 2537237641 |
| Cube | 127803197214811 |
| Square root | 224.434846 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0371 × |
50371 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and seventy-one |
| Binary (base 2) | 1100010011000011 |
| Octal (base 8) | 142303 |
| Hexadecimal (base 16) | C4C3 |
| Base 3 | 2120002121 |
| As time | 50371 seconds = 13 h 59 min 31 s |
Is 50371 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 3) | 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 6) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50371 a prime number?
No. 50371 = 17 × 2963, so it is divisible by 17.
What are the factors of 50371?
1, 17, 2963, 50371.
What is 50371 in binary?
1100010011000011 (hexadecimal C4C3, octal 142303).
What is the square root of 50371?
About 224.4348.
Is 50371 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50371?
50371 is a semiprime: 17 × 2963, the product of two primes.