The number 49122
49122 is a composite number with 12 divisors. Its prime factorisation is 2 × × 2729. Divisors (12): 1, 2, 3, 6, 9, 18, 2729, 5458, 8187, 16374, 24561, 49122.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49122: a Harshad number: divisible by its digit sum 18.
- 2
49122 is composite. Its prime factorisation is
- 3
The divisors add up to 106470; without 49122 itself that is 57348, so 49122 is abundant (57348 is more than 49122). Euler's totient φ(49122) = 16368 numbers up to 49122 share no factor with it.
- 4
The digits of 49122 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49122 = 2 \times 3^{2} \times 2729 \]49122 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 106470 |
| Euler totient φ(n) | 16368 |
| Square | 2412970884 |
| Cube | 118529955763848 |
| Square root | 221.634835 (= 3√5458) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9122 × |
49122 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and twenty-two |
| Binary (base 2) | 1011111111100010 |
| Octal (base 8) | 137742 |
| Hexadecimal (base 16) | BFE2 |
| Base 3 | 2111101100 |
| As time | 49122 seconds = 13 h 38 min 42 s |
Is 49122 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49122 ÷ 2 = 24561) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49122 ÷ 3 = 16374) | 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 | Yes (49122 ÷ 6 = 8187) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49122 ÷ 9 = 5458) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49122 a prime number?
No. 49122 = 2 × × 2729, so it is divisible by 2.
What are the factors of 49122?
1, 2, 3, 6, 9, 18, 2729, 5458, 8187, 16374, 24561, 49122.
What is 49122 in binary?
1011111111100010 (hexadecimal BFE2, octal 137742).
What is the square root of 49122?
About 221.6348, exactly 3√5458.
Is 49122 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 49122?
49122 is a Harshad number: divisible by its digit sum 18.