The number 49022
49022 is a composite number with 8 divisors. Its prime factorisation is 2 × 127 × 193. Divisors (8): 1, 2, 127, 193, 254, 386, 24511, 49022.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49022 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49022 is composite. Its prime factorisation is
- 3
The divisors add up to 74496; without 49022 itself that is 25474, so 49022 is deficient (25474 is less than 49022). Euler's totient φ(49022) = 24192 numbers up to 49022 share no factor with it.
- 4
The digits of 49022 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49022 = 2 \times 127 \times 193 \]
49022 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74496 |
| Euler totient φ(n) | 24192 |
| Square | 2403156484 |
| Cube | 117807537158648 |
| Square root | 221.409124 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9022 × |
49022 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and twenty-two |
| Binary (base 2) | 1011111101111110 |
| Octal (base 8) | 137576 |
| Hexadecimal (base 16) | BF7E |
| Base 3 | 2111020122 |
| As time | 49022 seconds = 13 h 37 min 2 s |
Is 49022 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49022 ÷ 2 = 24511) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49022 a prime number?
No. 49022 = 2 × 127 × 193, so it is divisible by 2.
What are the factors of 49022?
1, 2, 127, 193, 254, 386, 24511, 49022.
What is 49022 in binary?
1011111101111110 (hexadecimal BF7E, octal 137576).
What is the square root of 49022?
About 221.4091.
Is 49022 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 49022?
It is a composite number with 8 divisors.