The number 49522
49522 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 2251. Divisors (8): 1, 2, 11, 22, 2251, 4502, 24761, 49522.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49522: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 22.
- 2
49522 is composite. Its prime factorisation is
- 3
The divisors add up to 81072; without 49522 itself that is 31550, so 49522 is deficient (31550 is less than 49522). Euler's totient φ(49522) = 22500 numbers up to 49522 share no factor with it.
- 4
The digits of 49522 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49522 = 2 \times 11 \times 2251 \]
49522 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81072 |
| Euler totient φ(n) | 22500 |
| Square | 2452428484 |
| Cube | 121449163384648 |
| Square root | 222.535390 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.9522 × |
49522 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and twenty-two |
| Binary (base 2) | 1100000101110010 |
| Octal (base 8) | 140562 |
| Hexadecimal (base 16) | C172 |
| Base 3 | 2111221011 |
| As time | 49522 seconds = 13 h 45 min 22 s |
Is 49522 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49522 ÷ 2 = 24761) | 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 4) | 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 | Yes (49522 ÷ 11 = 4502) | 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 49522 a prime number?
No. 49522 = 2 × 11 × 2251, so it is divisible by 2.
What are the factors of 49522?
1, 2, 11, 22, 2251, 4502, 24761, 49522.
What is 49522 in binary?
1100000101110010 (hexadecimal C172, octal 140562).
What is the square root of 49522?
About 222.5354.
Is 49522 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49522?
49522 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 22.