The number 49557
49557 is a composite number with 4 divisors. Its prime factorisation is 3 × 16519. Divisors (4): 1, 3, 16519, 49557.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49557: a semiprime: 3 × 16519, the product of two primes.
- 2
49557 is composite. Its prime factorisation is
- 3
The divisors add up to 66080; without 49557 itself that is 16523, so 49557 is deficient (16523 is less than 49557). Euler's totient φ(49557) = 33036 numbers up to 49557 share no factor with it.
- 4
The digits of 49557 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49557 = 3 \times 16519 \]
49557 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66080 |
| Euler totient φ(n) | 33036 |
| Square | 2455896249 |
| Cube | 121706850411693 |
| Square root | 222.614016 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9557 × |
49557 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and fifty-seven |
| Binary (base 2) | 1100000110010101 |
| Octal (base 8) | 140625 |
| Hexadecimal (base 16) | C195 |
| Base 3 | 2111222110 |
| As time | 49557 seconds = 13 h 45 min 57 s |
Is 49557 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 | Yes (49557 ÷ 3 = 16519) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49557 a prime number?
No. 49557 = 3 × 16519, so it is divisible by 3.
What are the factors of 49557?
1, 3, 16519, 49557.
What is 49557 in binary?
1100000110010101 (hexadecimal C195, octal 140625).
What is the square root of 49557?
About 222.6140.
Is 49557 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49557?
49557 is a semiprime: 3 × 16519, the product of two primes.