The number 50557
50557 is a composite number with 4 divisors. Its prime factorisation is 13 × 3889. Divisors (4): 1, 13, 3889, 50557.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50557: a semiprime: 13 × 3889, the product of two primes.
- 2
50557 is composite. Its prime factorisation is
- 3
The divisors add up to 54460; without 50557 itself that is 3903, so 50557 is deficient (3903 is less than 50557). Euler's totient φ(50557) = 46656 numbers up to 50557 share no factor with it.
- 4
The digits of 50557 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50557 = 13 \times 3889 \]
50557 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54460 |
| Euler totient φ(n) | 46656 |
| Square | 2556010249 |
| Cube | 129224210158693 |
| Square root | 224.848838 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0557 × |
50557 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and fifty-seven |
| Binary (base 2) | 1100010101111101 |
| Octal (base 8) | 142575 |
| Hexadecimal (base 16) | C57D |
| Base 3 | 2120100111 |
| As time | 50557 seconds = 14 h 2 min 37 s |
Is 50557 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 2) | 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 3) | 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 7) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50557 a prime number?
No. 50557 = 13 × 3889, so it is divisible by 13.
What are the factors of 50557?
1, 13, 3889, 50557.
What is 50557 in binary?
1100010101111101 (hexadecimal C57D, octal 142575).
What is the square root of 50557?
About 224.8488.
Is 50557 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50557?
50557 is a semiprime: 13 × 3889, the product of two primes.