The number 49192
49192 is a composite number with 32 divisors. Its prime factorisation is × 11 × 13 × 43. Divisors (32): 1, 2, 4, 8, 11, 13, 22, 26, 43, 44, 52, 86, 88, 104, 143, 172 … 49192.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49192 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49192 is composite. Its prime factorisation is
- 3
The divisors add up to 110880; without 49192 itself that is 61688, so 49192 is abundant (61688 is more than 49192). Euler's totient φ(49192) = 20160 numbers up to 49192 share no factor with it.
- 4
The digits of 49192 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
\[ 49192 = 2^{3} \times 11 \times 13 \times 43 \]49192 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 110880 |
| Euler totient φ(n) | 20160 |
| Square | 2419852864 |
| Cube | 119037402085888 |
| Square root | 221.792696 (= 2√12298) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9192 × |
49192 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and ninety-two |
| Binary (base 2) | 1100000000101000 |
| Octal (base 8) | 140050 |
| Hexadecimal (base 16) | C028 |
| Base 3 | 2111110221 |
| As time | 49192 seconds = 13 h 39 min 52 s |
Is 49192 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49192 ÷ 2 = 24596) | 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 (49192 ÷ 4 = 12298) | 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 | 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 | Yes (49192 ÷ 8 = 6149) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49192 ÷ 11 = 4472) | 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 49192 a prime number?
No. 49192 = × 11 × 13 × 43, so it is divisible by 2.
What are the factors of 49192?
1, 2, 4, 8, 11, 13, 22, 26, 43, 44, 52, 86, 88, 104, 143, 172, 286, 344, 473, 559, 572, 946, 1118, 1144, 1892, 2236, 3784, 4472, 6149, 12298, 24596, 49192.
What is 49192 in binary?
1100000000101000 (hexadecimal C028, octal 140050).
What is the square root of 49192?
About 221.7927, exactly 2√12298.
Is 49192 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49192?
It is a composite number with 32 divisors.