The number 49198
49198 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 1447. Divisors (8): 1, 2, 17, 34, 1447, 2894, 24599, 49198.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49198 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49198 is composite. Its prime factorisation is
- 3
The divisors add up to 78192; without 49198 itself that is 28994, so 49198 is deficient (28994 is less than 49198). Euler's totient φ(49198) = 23136 numbers up to 49198 share no factor with it.
- 4
The digits of 49198 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49198 = 2 \times 17 \times 1447 \]
49198 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78192 |
| Euler totient φ(n) | 23136 |
| Square | 2420443204 |
| Cube | 119080964750392 |
| Square root | 221.806222 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9198 × |
49198 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and ninety-eight |
| Binary (base 2) | 1100000000101110 |
| Octal (base 8) | 140056 |
| Hexadecimal (base 16) | C02E |
| Base 3 | 2111111011 |
| As time | 49198 seconds = 13 h 39 min 58 s |
Is 49198 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49198 ÷ 2 = 24599) | 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 | 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49198 a prime number?
No. 49198 = 2 × 17 × 1447, so it is divisible by 2.
What are the factors of 49198?
1, 2, 17, 34, 1447, 2894, 24599, 49198.
What is 49198 in binary?
1100000000101110 (hexadecimal C02E, octal 140056).
What is the square root of 49198?
About 221.8062.
Is 49198 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49198?
It is a composite number with 8 divisors.