The number 49573
49573 is a composite number with 4 divisors. Its prime factorisation is 89 × 557. Divisors (4): 1, 89, 557, 49573.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49573: a semiprime: 89 × 557, the product of two primes.
- 2
49573 is composite. Its prime factorisation is
- 3
The divisors add up to 50220; without 49573 itself that is 647, so 49573 is deficient (647 is less than 49573). Euler's totient φ(49573) = 48928 numbers up to 49573 share no factor with it.
- 4
The digits of 49573 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49573 = 89 \times 557 \]
49573 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50220 |
| Euler totient φ(n) | 48928 |
| Square | 2457482329 |
| Cube | 121824771495517 |
| Square root | 222.649949 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9573 × |
49573 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and seventy-three |
| Binary (base 2) | 1100000110100101 |
| Octal (base 8) | 140645 |
| Hexadecimal (base 16) | C1A5 |
| Base 3 | 2112000001 |
| As time | 49573 seconds = 13 h 46 min 13 s |
Is 49573 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 7) | 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 49573 a prime number?
No. 49573 = 89 × 557, so it is divisible by 89.
What are the factors of 49573?
1, 89, 557, 49573.
What is 49573 in binary?
1100000110100101 (hexadecimal C1A5, octal 140645).
What is the square root of 49573?
About 222.6499.
Is 49573 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49573?
49573 is a semiprime: 89 × 557, the product of two primes.