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