The number 49577
49577 is a composite number with 4 divisors. Its prime factorisation is 11 × 4507. Divisors (4): 1, 11, 4507, 49577.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49577: a semiprime: 11 × 4507, the product of two primes.
- 2
49577 is composite. Its prime factorisation is
- 3
The divisors add up to 54096; without 49577 itself that is 4519, so 49577 is deficient (4519 is less than 49577). Euler's totient φ(49577) = 45060 numbers up to 49577 share no factor with it.
- 4
The digits of 49577 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49577 = 11 \times 4507 \]
49577 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54096 |
| Euler totient φ(n) | 45060 |
| Square | 2457878929 |
| Cube | 121854263663033 |
| Square root | 222.658932 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9577 × |
49577 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and seventy-seven |
| Binary (base 2) | 1100000110101001 |
| Octal (base 8) | 140651 |
| Hexadecimal (base 16) | C1A9 |
| Base 3 | 2112000012 |
| As time | 49577 seconds = 13 h 46 min 17 s |
Is 49577 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 | 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 1) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49577 ÷ 11 = 4507) | 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 49577 a prime number?
No. 49577 = 11 × 4507, so it is divisible by 11.
What are the factors of 49577?
1, 11, 4507, 49577.
What is 49577 in binary?
1100000110101001 (hexadecimal C1A9, octal 140651).
What is the square root of 49577?
About 222.6589.
Is 49577 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 49577?
49577 is a semiprime: 11 × 4507, the product of two primes.