The number 49566
49566 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 11 × 751. Divisors (16): 1, 2, 3, 6, 11, 22, 33, 66, 751, 1502, 2253, 4506, 8261, 16522, 24783, 49566.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49566 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49566 is composite. Its prime factorisation is
- 3
The divisors add up to 108288; without 49566 itself that is 58722, so 49566 is abundant (58722 is more than 49566). Euler's totient φ(49566) = 15000 numbers up to 49566 share no factor with it.
- 4
The digits of 49566 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49566 = 2 \times 3 \times 11 \times 751 \]
49566 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 108288 |
| Euler totient φ(n) | 15000 |
| Square | 2456788356 |
| Cube | 121773171653496 |
| Square root | 222.634229 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9566 × |
49566 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and sixty-six |
| Binary (base 2) | 1100000110011110 |
| Octal (base 8) | 140636 |
| Hexadecimal (base 16) | C19E |
| Base 3 | 2111222210 |
| As time | 49566 seconds = 13 h 46 min 6 s |
Is 49566 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49566 ÷ 2 = 24783) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49566 ÷ 3 = 16522) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49566 ÷ 6 = 8261) | 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 6) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49566 ÷ 11 = 4506) | 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 49566 a prime number?
No. 49566 = 2 × 3 × 11 × 751, so it is divisible by 2.
What are the factors of 49566?
1, 2, 3, 6, 11, 22, 33, 66, 751, 1502, 2253, 4506, 8261, 16522, 24783, 49566.
What is 49566 in binary?
1100000110011110 (hexadecimal C19E, octal 140636).
What is the square root of 49566?
About 222.6342.
Is 49566 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49566?
It is a composite number with 16 divisors.