The number 49660
49660 is a composite number with 24 divisors. Its prime factorisation is × 5 × 13 × 191. Divisors (24): 1, 2, 4, 5, 10, 13, 20, 26, 52, 65, 130, 191, 260, 382, 764, 955 … 49660.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49660 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49660 is composite. Its prime factorisation is
- 3
The divisors add up to 112896; without 49660 itself that is 63236, so 49660 is abundant (63236 is more than 49660). Euler's totient φ(49660) = 18240 numbers up to 49660 share no factor with it.
- 4
The digits of 49660 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49660 = 2^{2} \times 5 \times 13 \times 191 \]49660 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 112896 |
| Euler totient φ(n) | 18240 |
| Square | 2466115600 |
| Cube | 122467300696000 |
| Square root | 222.845238 (= 2√12415) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.966 × |
49660 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and sixty |
| Binary (base 2) | 1100000111111100 |
| Octal (base 8) | 140774 |
| Hexadecimal (base 16) | C1FC |
| Base 3 | 2112010021 |
| As time | 49660 seconds = 13 h 47 min 40 s |
Is 49660 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49660 ÷ 2 = 24830) | 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 (49660 ÷ 4 = 12415) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (49660 ÷ 5 = 9932) | 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 2) | 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 4) | 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 | Yes (49660 ÷ 10 = 4966) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49660 a prime number?
No. 49660 = × 5 × 13 × 191, so it is divisible by 2.
What are the factors of 49660?
1, 2, 4, 5, 10, 13, 20, 26, 52, 65, 130, 191, 260, 382, 764, 955, 1910, 2483, 3820, 4966, 9932, 12415, 24830, 49660.
What is 49660 in binary?
1100000111111100 (hexadecimal C1FC, octal 140774).
What is the square root of 49660?
About 222.8452, exactly 2√12415.
Is 49660 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49660?
It is a composite number with 24 divisors.