The number 50522
50522 is a composite number with 4 divisors. Its prime factorisation is 2 × 25261. Divisors (4): 1, 2, 25261, 50522.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50522: a semiprime: 2 × 25261, the product of two primes.
- 2
50522 is composite. Its prime factorisation is
- 3
The divisors add up to 75786; without 50522 itself that is 25264, so 50522 is deficient (25264 is less than 50522). Euler's totient φ(50522) = 25260 numbers up to 50522 share no factor with it.
- 4
The digits of 50522 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50522 = 2 \times 25261 \]
50522 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 75786 |
| Euler totient φ(n) | 25260 |
| Square | 2552472484 |
| Cube | 128956014836648 |
| Square root | 224.770995 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0522 × |
50522 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and twenty-two |
| Binary (base 2) | 1100010101011010 |
| Octal (base 8) | 142532 |
| Hexadecimal (base 16) | C55A |
| Base 3 | 2120022012 |
| As time | 50522 seconds = 14 h 2 min 2 s |
Is 50522 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50522 ÷ 2 = 25261) | 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 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 | No (remainder 5) | 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 10) | 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 50522 a prime number?
No. 50522 = 2 × 25261, so it is divisible by 2.
What are the factors of 50522?
1, 2, 25261, 50522.
What is 50522 in binary?
1100010101011010 (hexadecimal C55A, octal 142532).
What is the square root of 50522?
About 224.7710.
Is 50522 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50522?
50522 is a semiprime: 2 × 25261, the product of two primes.