The number 49782
49782 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8297. Divisors (8): 1, 2, 3, 6, 8297, 16594, 24891, 49782.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49782 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49782 is composite. Its prime factorisation is
- 3
The divisors add up to 99576; without 49782 itself that is 49794, so 49782 is abundant (49794 is more than 49782). Euler's totient φ(49782) = 16592 numbers up to 49782 share no factor with it.
- 4
The digits of 49782 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49782 = 2 \times 3 \times 8297 \]
49782 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 99576 |
| Euler totient φ(n) | 16592 |
| Square | 2478247524 |
| Cube | 123372118239768 |
| Square root | 223.118802 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9782 × |
49782 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and eighty-two |
| Binary (base 2) | 1100001001110110 |
| Octal (base 8) | 141166 |
| Hexadecimal (base 16) | C276 |
| Base 3 | 2112021210 |
| As time | 49782 seconds = 13 h 49 min 42 s |
Is 49782 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49782 ÷ 2 = 24891) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49782 ÷ 3 = 16594) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49782 ÷ 6 = 8297) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | 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 49782 a prime number?
No. 49782 = 2 × 3 × 8297, so it is divisible by 2.
What are the factors of 49782?
1, 2, 3, 6, 8297, 16594, 24891, 49782.
What is 49782 in binary?
1100001001110110 (hexadecimal C276, octal 141166).
What is the square root of 49782?
About 223.1188.
Is 49782 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49782?
It is a composite number with 8 divisors.