The number 49550
49550 is a composite number with 12 divisors. Its prime factorisation is 2 × × 991. Divisors (12): 1, 2, 5, 10, 25, 50, 991, 1982, 4955, 9910, 24775, 49550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49550 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49550 is composite. Its prime factorisation is
- 3
The divisors add up to 92256; without 49550 itself that is 42706, so 49550 is deficient (42706 is less than 49550). Euler's totient φ(49550) = 19800 numbers up to 49550 share no factor with it.
- 4
The digits of 49550 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49550 = 2 \times 5^{2} \times 991 \]49550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 92256 |
| Euler totient φ(n) | 19800 |
| Square | 2455202500 |
| Cube | 121655283875000 |
| Square root | 222.598293 (= 5√1982) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.955 × |
49550 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and fifty |
| Binary (base 2) | 1100000110001110 |
| Octal (base 8) | 140616 |
| Hexadecimal (base 16) | C18E |
| Base 3 | 2111222012 |
| As time | 49550 seconds = 13 h 45 min 50 s |
Is 49550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49550 ÷ 2 = 24775) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49550 ÷ 5 = 9910) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | 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 | Yes (49550 ÷ 10 = 4955) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49550 a prime number?
No. 49550 = 2 × × 991, so it is divisible by 2.
What are the factors of 49550?
1, 2, 5, 10, 25, 50, 991, 1982, 4955, 9910, 24775, 49550.
What is 49550 in binary?
1100000110001110 (hexadecimal C18E, octal 140616).
What is the square root of 49550?
About 222.5983, exactly 5√1982.
Is 49550 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49550?
It is a composite number with 12 divisors.