The number 49162
49162 is a composite number with 8 divisors. Its prime factorisation is 2 × 47 × 523. Divisors (8): 1, 2, 47, 94, 523, 1046, 24581, 49162.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49162 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49162 is composite. Its prime factorisation is
- 3
The divisors add up to 75456; without 49162 itself that is 26294, so 49162 is deficient (26294 is less than 49162). Euler's totient φ(49162) = 24012 numbers up to 49162 share no factor with it.
- 4
The digits of 49162 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49162 = 2 \times 47 \times 523 \]
49162 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75456 |
| Euler totient φ(n) | 24012 |
| Square | 2416902244 |
| Cube | 118819748119528 |
| Square root | 221.725055 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9162 × |
49162 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and sixty-two |
| Binary (base 2) | 1100000000001010 |
| Octal (base 8) | 140012 |
| Hexadecimal (base 16) | C00A |
| Base 3 | 2111102211 |
| As time | 49162 seconds = 13 h 39 min 22 s |
Is 49162 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49162 ÷ 2 = 24581) | 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 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 1) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 49162 a prime number?
No. 49162 = 2 × 47 × 523, so it is divisible by 2.
What are the factors of 49162?
1, 2, 47, 94, 523, 1046, 24581, 49162.
What is 49162 in binary?
1100000000001010 (hexadecimal C00A, octal 140012).
What is the square root of 49162?
About 221.7251.
Is 49162 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49162?
It is a composite number with 8 divisors.