The number 50530
50530 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 31 × 163. Divisors (16): 1, 2, 5, 10, 31, 62, 155, 163, 310, 326, 815, 1630, 5053, 10106, 25265, 50530.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50530 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50530 is composite. Its prime factorisation is
- 3
The divisors add up to 94464; without 50530 itself that is 43934, so 50530 is deficient (43934 is less than 50530). Euler's totient φ(50530) = 19440 numbers up to 50530 share no factor with it.
- 4
The digits of 50530 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50530 = 2 \times 5 \times 31 \times 163 \]
50530 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 94464 |
| Euler totient φ(n) | 19440 |
| Square | 2553280900 |
| Cube | 129017283877000 |
| Square root | 224.788790 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.053 × |
50530 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and thirty |
| Binary (base 2) | 1100010101100010 |
| Octal (base 8) | 142542 |
| Hexadecimal (base 16) | C562 |
| Base 3 | 2120022111 |
| As time | 50530 seconds = 14 h 2 min 10 s |
Is 50530 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50530 ÷ 2 = 25265) | 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 | Yes (50530 ÷ 5 = 10106) | 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 | Yes (50530 ÷ 10 = 5053) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50530 a prime number?
No. 50530 = 2 × 5 × 31 × 163, so it is divisible by 2.
What are the factors of 50530?
1, 2, 5, 10, 31, 62, 155, 163, 310, 326, 815, 1630, 5053, 10106, 25265, 50530.
What is 50530 in binary?
1100010101100010 (hexadecimal C562, octal 142542).
What is the square root of 50530?
About 224.7888.
Is 50530 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50530?
It is a composite number with 16 divisors.