The number 49948
49948 is a composite number with 6 divisors. Its prime factorisation is × 12487. Divisors (6): 1, 2, 4, 12487, 24974, 49948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49948 is composite. Its prime factorisation is
- 3
The divisors add up to 87416; without 49948 itself that is 37468, so 49948 is deficient (37468 is less than 49948). Euler's totient φ(49948) = 24972 numbers up to 49948 share no factor with it.
- 4
The digits of 49948 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49948 = 2^{2} \times 12487 \]49948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 87416 |
| Euler totient φ(n) | 24972 |
| Square | 2494802704 |
| Cube | 124610405459392 |
| Square root | 223.490492 (= 2√12487) |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.9948 × |
49948 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and forty-eight |
| Binary (base 2) | 1100001100011100 |
| Octal (base 8) | 141434 |
| Hexadecimal (base 16) | C31C |
| Base 3 | 2112111221 |
| As time | 49948 seconds = 13 h 52 min 28 s |
Is 49948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49948 ÷ 2 = 24974) | 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 (49948 ÷ 4 = 12487) | 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 3) | 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 4) | 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 8) | 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 49948 a prime number?
No. 49948 = × 12487, so it is divisible by 2.
What are the factors of 49948?
1, 2, 4, 12487, 24974, 49948.
What is 49948 in binary?
1100001100011100 (hexadecimal C31C, octal 141434).
What is the square root of 49948?
About 223.4905, exactly 2√12487.
Is 49948 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 49948?
It is a composite number with 6 divisors.