The number 50540
50540 is a composite number with 36 divisors. Its prime factorisation is × 5 × 7 × . Divisors (36): 1, 2, 4, 5, 7, 10, 14, 19, 20, 28, 35, 38, 70, 76, 95, 133 … 50540.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50540: a Harshad number: divisible by its digit sum 14.
- 2
50540 is composite. Its prime factorisation is
- 3
The divisors add up to 128016; without 50540 itself that is 77476, so 50540 is abundant (77476 is more than 50540). Euler's totient φ(50540) = 16416 numbers up to 50540 share no factor with it.
- 4
The digits of 50540 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50540 = 2^{2} \times 5 \times 7 \times 19^{2} \]50540 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 128016 |
| Euler totient φ(n) | 16416 |
| Square | 2554291600 |
| Cube | 129093897464000 |
| Square root | 224.811032 (= 38√35) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.054 × |
50540 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and forty |
| Binary (base 2) | 1100010101101100 |
| Octal (base 8) | 142554 |
| Hexadecimal (base 16) | C56C |
| Base 3 | 2120022212 |
| As time | 50540 seconds = 14 h 2 min 20 s |
Is 50540 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50540 ÷ 2 = 25270) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50540 ÷ 4 = 12635) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50540 ÷ 5 = 10108) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50540 ÷ 7 = 7220) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50540 ÷ 10 = 5054) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50540 a prime number?
No. 50540 = × 5 × 7 × , so it is divisible by 2.
What are the factors of 50540?
1, 2, 4, 5, 7, 10, 14, 19, 20, 28, 35, 38, 70, 76, 95, 133, 140, 190, 266, 361, 380, 532, 665, 722, 1330, 1444, 1805, 2527, 2660, 3610, 5054, 7220, 10108, 12635, 25270, 50540.
What is 50540 in binary?
1100010101101100 (hexadecimal C56C, octal 142554).
What is the square root of 50540?
About 224.8110, exactly 38√35.
Is 50540 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50540?
50540 is a Harshad number: divisible by its digit sum 14.