The number 50529
50529 is a composite number with 4 divisors. Its prime factorisation is 3 × 16843. Divisors (4): 1, 3, 16843, 50529.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50529: a semiprime: 3 × 16843, the product of two primes.
- 2
50529 is composite. Its prime factorisation is
- 3
The divisors add up to 67376; without 50529 itself that is 16847, so 50529 is deficient (16847 is less than 50529). Euler's totient φ(50529) = 33684 numbers up to 50529 share no factor with it.
- 4
The digits of 50529 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50529 = 3 \times 16843 \]
50529 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67376 |
| Euler totient φ(n) | 33684 |
| Square | 2553179841 |
| Cube | 129009624185889 |
| Square root | 224.786565 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0529 × |
50529 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and twenty-nine |
| Binary (base 2) | 1100010101100001 |
| Octal (base 8) | 142541 |
| Hexadecimal (base 16) | C561 |
| Base 3 | 2120022110 |
| As time | 50529 seconds = 14 h 2 min 9 s |
Is 50529 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50529 ÷ 3 = 16843) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50529 a prime number?
No. 50529 = 3 × 16843, so it is divisible by 3.
What are the factors of 50529?
1, 3, 16843, 50529.
What is 50529 in binary?
1100010101100001 (hexadecimal C561, octal 142541).
What is the square root of 50529?
About 224.7866.
Is 50529 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50529?
50529 is a semiprime: 3 × 16843, the product of two primes.