The number 50057
50057 is a composite number with 4 divisors. Its prime factorisation is 7 × 7151. Divisors (4): 1, 7, 7151, 50057.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50057: a semiprime: 7 × 7151, the product of two primes.
- 2
50057 is composite. Its prime factorisation is
- 3
The divisors add up to 57216; without 50057 itself that is 7159, so 50057 is deficient (7159 is less than 50057). Euler's totient φ(50057) = 42900 numbers up to 50057 share no factor with it.
- 4
The digits of 50057 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 233 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50057 = 7 \times 7151 \]
50057 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57216 |
| Euler totient φ(n) | 42900 |
| Square | 2505703249 |
| Cube | 125427987535193 |
| Square root | 223.734217 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 233 |
| Scientific notation | 5.0057 × |
50057 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and fifty-seven |
| Binary (base 2) | 1100001110001001 |
| Octal (base 8) | 141611 |
| Hexadecimal (base 16) | C389 |
| Base 3 | 2112122222 |
| As time | 50057 seconds = 13 h 54 min 17 s |
Is 50057 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 2) | 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 (50057 ÷ 7 = 7151) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 50057 a prime number?
No. 50057 = 7 × 7151, so it is divisible by 7.
What are the factors of 50057?
1, 7, 7151, 50057.
What is 50057 in binary?
1100001110001001 (hexadecimal C389, octal 141611).
What is the square root of 50057?
About 223.7342.
Is 50057 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50057?
50057 is a semiprime: 7 × 7151, the product of two primes.