The number 50500
50500 is a composite number with 24 divisors. Its prime factorisation is × × 101. Divisors (24): 1, 2, 4, 5, 10, 20, 25, 50, 100, 101, 125, 202, 250, 404, 500, 505 … 50500.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50500: a Harshad number: divisible by its digit sum 10.
- 2
50500 is composite. Its prime factorisation is
- 3
The divisors add up to 111384; without 50500 itself that is 60884, so 50500 is abundant (60884 is more than 50500). Euler's totient φ(50500) = 20000 numbers up to 50500 share no factor with it.
- 4
The digits of 50500 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50500 = 2^{2} \times 5^{3} \times 101 \]50500 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 111384 |
| Euler totient φ(n) | 20000 |
| Square | 2550250000 |
| Cube | 128787625000000 |
| Square root | 224.722051 (= 10√505) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.05 × |
50500 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred |
| Binary (base 2) | 1100010101000100 |
| Octal (base 8) | 142504 |
| Hexadecimal (base 16) | C544 |
| Base 3 | 2120021101 |
| As time | 50500 seconds = 14 h 1 min 40 s |
Is 50500 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50500 ÷ 2 = 25250) | 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 | Yes (50500 ÷ 4 = 12625) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50500 ÷ 5 = 10100) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50500 ÷ 10 = 5050) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50500 a prime number?
No. 50500 = × × 101, so it is divisible by 2.
What are the factors of 50500?
1, 2, 4, 5, 10, 20, 25, 50, 100, 101, 125, 202, 250, 404, 500, 505, 1010, 2020, 2525, 5050, 10100, 12625, 25250, 50500.
What is 50500 in binary?
1100010101000100 (hexadecimal C544, octal 142504).
What is the square root of 50500?
About 224.7221, exactly 10√505.
Is 50500 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 50500?
50500 is a Harshad number: divisible by its digit sum 10.