The number 49638
49638 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8273. Divisors (8): 1, 2, 3, 6, 8273, 16546, 24819, 49638.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49638 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49638 is composite. Its prime factorisation is
- 3
The divisors add up to 99288; without 49638 itself that is 49650, so 49638 is abundant (49650 is more than 49638). Euler's totient φ(49638) = 16544 numbers up to 49638 share no factor with it.
- 4
The digits of 49638 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49638 = 2 \times 3 \times 8273 \]
49638 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 99288 |
| Euler totient φ(n) | 16544 |
| Square | 2463931044 |
| Cube | 122304609162072 |
| Square root | 222.795871 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9638 × |
49638 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and thirty-eight |
| Binary (base 2) | 1100000111100110 |
| Octal (base 8) | 140746 |
| Hexadecimal (base 16) | C1E6 |
| Base 3 | 2112002110 |
| As time | 49638 seconds = 13 h 47 min 18 s |
Is 49638 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49638 ÷ 2 = 24819) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49638 ÷ 3 = 16546) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49638 ÷ 6 = 8273) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49638 a prime number?
No. 49638 = 2 × 3 × 8273, so it is divisible by 2.
What are the factors of 49638?
1, 2, 3, 6, 8273, 16546, 24819, 49638.
What is 49638 in binary?
1100000111100110 (hexadecimal C1E6, octal 140746).
What is the square root of 49638?
About 222.7959.
Is 49638 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49638?
It is a composite number with 8 divisors.