The number 49650
49650 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 331. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 331, 662, 993, 1655 … 49650.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49650 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49650 is composite. Its prime factorisation is
- 3
The divisors add up to 123504; without 49650 itself that is 73854, so 49650 is abundant (73854 is more than 49650). Euler's totient φ(49650) = 13200 numbers up to 49650 share no factor with it.
- 4
The digits of 49650 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49650 = 2 \times 3 \times 5^{2} \times 331 \]49650 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 123504 |
| Euler totient φ(n) | 13200 |
| Square | 2465122500 |
| Cube | 122393332125000 |
| Square root | 222.822800 (= 5√1986) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.965 × |
49650 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and fifty |
| Binary (base 2) | 1100000111110010 |
| Octal (base 8) | 140762 |
| Hexadecimal (base 16) | C1F2 |
| Base 3 | 2112002220 |
| As time | 49650 seconds = 13 h 47 min 30 s |
Is 49650 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49650 ÷ 2 = 24825) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49650 ÷ 3 = 16550) | 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 (49650 ÷ 5 = 9930) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49650 ÷ 6 = 8275) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (49650 ÷ 10 = 4965) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49650 a prime number?
No. 49650 = 2 × 3 × × 331, so it is divisible by 2.
What are the factors of 49650?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 331, 662, 993, 1655, 1986, 3310, 4965, 8275, 9930, 16550, 24825, 49650.
What is 49650 in binary?
1100000111110010 (hexadecimal C1F2, octal 140762).
What is the square root of 49650?
About 222.8228, exactly 5√1986.
Is 49650 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49650?
It is a composite number with 24 divisors.