The number 49048
49048 is a composite number with 8 divisors. Its prime factorisation is × 6131. Divisors (8): 1, 2, 4, 8, 6131, 12262, 24524, 49048.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49048 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49048 is composite. Its prime factorisation is
- 3
The divisors add up to 91980; without 49048 itself that is 42932, so 49048 is deficient (42932 is less than 49048). Euler's totient φ(49048) = 24520 numbers up to 49048 share no factor with it.
- 4
The digits of 49048 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49048 = 2^{3} \times 6131 \]49048 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91980 |
| Euler totient φ(n) | 24520 |
| Square | 2405706304 |
| Cube | 117995082798592 |
| Square root | 221.467831 (= 2√12262) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9048 × |
49048 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and forty-eight |
| Binary (base 2) | 1011111110011000 |
| Octal (base 8) | 137630 |
| Hexadecimal (base 16) | BF98 |
| Base 3 | 2111021121 |
| As time | 49048 seconds = 13 h 37 min 28 s |
Is 49048 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49048 ÷ 2 = 24524) | 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 (49048 ÷ 4 = 12262) | 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 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 | Yes (49048 ÷ 8 = 6131) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 10) | 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 49048 a prime number?
No. 49048 = × 6131, so it is divisible by 2.
What are the factors of 49048?
1, 2, 4, 8, 6131, 12262, 24524, 49048.
What is 49048 in binary?
1011111110011000 (hexadecimal BF98, octal 137630).
What is the square root of 49048?
About 221.4678, exactly 2√12262.
Is 49048 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49048?
It is a composite number with 8 divisors.