The number 49648
49648 is a composite number with 20 divisors. Its prime factorisation is × 29 × 107. Divisors (20): 1, 2, 4, 8, 16, 29, 58, 107, 116, 214, 232, 428, 464, 856, 1712, 3103 … 49648.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49648 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49648 is composite. Its prime factorisation is
- 3
The divisors add up to 100440; without 49648 itself that is 50792, so 49648 is abundant (50792 is more than 49648). Euler's totient φ(49648) = 23744 numbers up to 49648 share no factor with it.
- 4
The digits of 49648 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49648 = 2^{4} \times 29 \times 107 \]49648 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 100440 |
| Euler totient φ(n) | 23744 |
| Square | 2464923904 |
| Cube | 122378541985792 |
| Square root | 222.818312 (= 4√3103) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9648 × |
49648 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and forty-eight |
| Binary (base 2) | 1100000111110000 |
| Octal (base 8) | 140760 |
| Hexadecimal (base 16) | C1F0 |
| Base 3 | 2112002211 |
| As time | 49648 seconds = 13 h 47 min 28 s |
Is 49648 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49648 ÷ 2 = 24824) | 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 (49648 ÷ 4 = 12412) | 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 | No (remainder 4) | 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 | Yes (49648 ÷ 8 = 6206) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 5) | 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 49648 a prime number?
No. 49648 = × 29 × 107, so it is divisible by 2.
What are the factors of 49648?
1, 2, 4, 8, 16, 29, 58, 107, 116, 214, 232, 428, 464, 856, 1712, 3103, 6206, 12412, 24824, 49648.
What is 49648 in binary?
1100000111110000 (hexadecimal C1F0, octal 140760).
What is the square root of 49648?
About 222.8183, exactly 4√3103.
Is 49648 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49648?
It is a composite number with 20 divisors.