The number 49552
49552 is a composite number with 20 divisors. Its prime factorisation is × 19 × 163. Divisors (20): 1, 2, 4, 8, 16, 19, 38, 76, 152, 163, 304, 326, 652, 1304, 2608, 3097 … 49552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49552 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49552 is composite. Its prime factorisation is
- 3
The divisors add up to 101680; without 49552 itself that is 52128, so 49552 is abundant (52128 is more than 49552). Euler's totient φ(49552) = 23328 numbers up to 49552 share no factor with it.
- 4
The digits of 49552 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49552 = 2^{4} \times 19 \times 163 \]49552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 101680 |
| Euler totient φ(n) | 23328 |
| Square | 2455400704 |
| Cube | 121670015684608 |
| Square root | 222.602785 (= 4√3097) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9552 × |
49552 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and fifty-two |
| Binary (base 2) | 1100000110010000 |
| Octal (base 8) | 140620 |
| Hexadecimal (base 16) | C190 |
| Base 3 | 2111222021 |
| As time | 49552 seconds = 13 h 45 min 52 s |
Is 49552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49552 ÷ 2 = 24776) | 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 | Yes (49552 ÷ 4 = 12388) | 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 4) | 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 | Yes (49552 ÷ 8 = 6194) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49552 a prime number?
No. 49552 = × 19 × 163, so it is divisible by 2.
What are the factors of 49552?
1, 2, 4, 8, 16, 19, 38, 76, 152, 163, 304, 326, 652, 1304, 2608, 3097, 6194, 12388, 24776, 49552.
What is 49552 in binary?
1100000110010000 (hexadecimal C190, octal 140620).
What is the square root of 49552?
About 222.6028, exactly 4√3097.
Is 49552 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49552?
It is a composite number with 20 divisors.