The number 50573
50573 is a composite number with 4 divisors. Its prime factorisation is 103 × 491. Divisors (4): 1, 103, 491, 50573.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50573: a semiprime: 103 × 491, the product of two primes.
- 2
50573 is composite. Its prime factorisation is
- 3
The divisors add up to 51168; without 50573 itself that is 595, so 50573 is deficient (595 is less than 50573). Euler's totient φ(50573) = 49980 numbers up to 50573 share no factor with it.
- 4
The digits of 50573 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50573 = 103 \times 491 \]
50573 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51168 |
| Euler totient φ(n) | 49980 |
| Square | 2557628329 |
| Cube | 129346937482517 |
| Square root | 224.884415 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0573 × |
50573 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and seventy-three |
| Binary (base 2) | 1100010110001101 |
| Octal (base 8) | 142615 |
| Hexadecimal (base 16) | C58D |
| Base 3 | 2120101002 |
| As time | 50573 seconds = 14 h 2 min 53 s |
Is 50573 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 3) | 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 5) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 50573 a prime number?
No. 50573 = 103 × 491, so it is divisible by 103.
What are the factors of 50573?
1, 103, 491, 50573.
What is 50573 in binary?
1100010110001101 (hexadecimal C58D, octal 142615).
What is the square root of 50573?
About 224.8844.
Is 50573 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50573?
50573 is a semiprime: 103 × 491, the product of two primes.