The number 50523
50523 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1531. Divisors (8): 1, 3, 11, 33, 1531, 4593, 16841, 50523.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50523 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50523 is composite. Its prime factorisation is
- 3
The divisors add up to 73536; without 50523 itself that is 23013, so 50523 is deficient (23013 is less than 50523). Euler's totient φ(50523) = 30600 numbers up to 50523 share no factor with it.
- 4
The digits of 50523 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 233 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50523 = 3 \times 11 \times 1531 \]
50523 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 73536 |
| Euler totient φ(n) | 30600 |
| Square | 2552573529 |
| Cube | 128963672405667 |
| Square root | 224.773219 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 233 |
| Scientific notation | 5.0523 × |
50523 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and twenty-three |
| Binary (base 2) | 1100010101011011 |
| Octal (base 8) | 142533 |
| Hexadecimal (base 16) | C55B |
| Base 3 | 2120022020 |
| As time | 50523 seconds = 14 h 2 min 3 s |
Is 50523 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 (50523 ÷ 3 = 16841) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50523 ÷ 11 = 4593) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50523 a prime number?
No. 50523 = 3 × 11 × 1531, so it is divisible by 3.
What are the factors of 50523?
1, 3, 11, 33, 1531, 4593, 16841, 50523.
What is 50523 in binary?
1100010101011011 (hexadecimal C55B, octal 142533).
What is the square root of 50523?
About 224.7732.
Is 50523 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50523?
It is a composite number with 8 divisors.