The number 50535
50535 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1123. Divisors (12): 1, 3, 5, 9, 15, 45, 1123, 3369, 5615, 10107, 16845, 50535.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50535 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50535 is composite. Its prime factorisation is
- 3
The divisors add up to 87672; without 50535 itself that is 37137, so 50535 is deficient (37137 is less than 50535). Euler's totient φ(50535) = 26928 numbers up to 50535 share no factor with it.
- 4
The digits of 50535 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50535 = 3^{2} \times 5 \times 1123 \]50535 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 87672 |
| Euler totient φ(n) | 26928 |
| Square | 2553786225 |
| Cube | 129055586880375 |
| Square root | 224.799911 (= 3√5615) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0535 × |
50535 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and thirty-five |
| Binary (base 2) | 1100010101100111 |
| Octal (base 8) | 142547 |
| Hexadecimal (base 16) | C567 |
| Base 3 | 2120022200 |
| As time | 50535 seconds = 14 h 2 min 15 s |
Is 50535 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 (50535 ÷ 3 = 16845) | 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 | Yes (50535 ÷ 5 = 10107) | 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 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50535 ÷ 9 = 5615) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 50535 a prime number?
No. 50535 = × 5 × 1123, so it is divisible by 3.
What are the factors of 50535?
1, 3, 5, 9, 15, 45, 1123, 3369, 5615, 10107, 16845, 50535.
What is 50535 in binary?
1100010101100111 (hexadecimal C567, octal 142547).
What is the square root of 50535?
About 224.7999, exactly 3√5615.
Is 50535 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50535?
It is a composite number with 12 divisors.