The number 49662
49662 is a composite number with 24 divisors. Its prime factorisation is 2 × × 31 × 89. Divisors (24): 1, 2, 3, 6, 9, 18, 31, 62, 89, 93, 178, 186, 267, 279, 534, 558 … 49662.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49662 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49662 is composite. Its prime factorisation is
- 3
The divisors add up to 112320; without 49662 itself that is 62658, so 49662 is abundant (62658 is more than 49662). Euler's totient φ(49662) = 15840 numbers up to 49662 share no factor with it.
- 4
The digits of 49662 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49662 = 2 \times 3^{2} \times 31 \times 89 \]49662 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 112320 |
| Euler totient φ(n) | 15840 |
| Square | 2466314244 |
| Cube | 122482097985528 |
| Square root | 222.849725 (= 3√5518) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9662 × |
49662 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and sixty-two |
| Binary (base 2) | 1100000111111110 |
| Octal (base 8) | 140776 |
| Hexadecimal (base 16) | C1FE |
| Base 3 | 2112010100 |
| As time | 49662 seconds = 13 h 47 min 42 s |
Is 49662 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49662 ÷ 2 = 24831) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49662 ÷ 3 = 16554) | 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 (49662 ÷ 6 = 8277) | 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 | Yes (49662 ÷ 9 = 5518) | 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 8) | 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 49662 a prime number?
No. 49662 = 2 × × 31 × 89, so it is divisible by 2.
What are the factors of 49662?
1, 2, 3, 6, 9, 18, 31, 62, 89, 93, 178, 186, 267, 279, 534, 558, 801, 1602, 2759, 5518, 8277, 16554, 24831, 49662.
What is 49662 in binary?
1100000111111110 (hexadecimal C1FE, octal 140776).
What is the square root of 49662?
About 222.8497, exactly 3√5518.
Is 49662 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49662?
It is a composite number with 24 divisors.