The number 50580
50580 is a composite number with 36 divisors. Its prime factorisation is × × 5 × 281. Divisors (36): 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 30, 36, 45, 60 … 50580.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50580: a Harshad number: divisible by its digit sum 18.
- 2
50580 is composite. Its prime factorisation is
- 3
The divisors add up to 153972; without 50580 itself that is 103392, so 50580 is abundant (103392 is more than 50580). Euler's totient φ(50580) = 13440 numbers up to 50580 share no factor with it.
- 4
The digits of 50580 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50580 = 2^{2} \times 3^{2} \times 5 \times 281 \]50580 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 153972 |
| Euler totient φ(n) | 13440 |
| Square | 2558336400 |
| Cube | 129400655112000 |
| Square root | 224.899978 (= 6√1405) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.058 × |
50580 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and eighty |
| Binary (base 2) | 1100010110010100 |
| Octal (base 8) | 142624 |
| Hexadecimal (base 16) | C594 |
| Base 3 | 2120101100 |
| As time | 50580 seconds = 14 h 3 min 0 s |
Is 50580 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50580 ÷ 2 = 25290) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50580 ÷ 3 = 16860) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50580 ÷ 4 = 12645) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50580 ÷ 5 = 10116) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50580 ÷ 6 = 8430) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (50580 ÷ 9 = 5620) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50580 ÷ 10 = 5058) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50580 ÷ 12 = 4215) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50580 a prime number?
No. 50580 = × × 5 × 281, so it is divisible by 2.
What are the factors of 50580?
1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 30, 36, 45, 60, 90, 180, 281, 562, 843, 1124, 1405, 1686, 2529, 2810, 3372, 4215, 5058, 5620, 8430, 10116, 12645, 16860, 25290, 50580.
What is 50580 in binary?
1100010110010100 (hexadecimal C594, octal 142624).
What is the square root of 50580?
About 224.9000, exactly 6√1405.
Is 50580 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50580?
50580 is a Harshad number: divisible by its digit sum 18.