The number 50520
50520 is a composite number with 32 divisors. Its prime factorisation is × 3 × 5 × 421. Divisors (32): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120 … 50520.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50520: a Harshad number: divisible by its digit sum 12.
- 2
50520 is composite. Its prime factorisation is
- 3
The divisors add up to 151920; without 50520 itself that is 101400, so 50520 is abundant (101400 is more than 50520). Euler's totient φ(50520) = 13440 numbers up to 50520 share no factor with it.
- 4
The digits of 50520 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50520 = 2^{3} \times 3 \times 5 \times 421 \]50520 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 151920 |
| Euler totient φ(n) | 13440 |
| Square | 2552270400 |
| Cube | 128940700608000 |
| Square root | 224.766546 (= 2√12630) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.052 × |
50520 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and twenty |
| Binary (base 2) | 1100010101011000 |
| Octal (base 8) | 142530 |
| Hexadecimal (base 16) | C558 |
| Base 3 | 2120022010 |
| As time | 50520 seconds = 14 h 2 min 0 s |
Is 50520 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50520 ÷ 2 = 25260) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50520 ÷ 3 = 16840) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50520 ÷ 4 = 12630) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50520 ÷ 5 = 10104) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50520 ÷ 6 = 8420) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (50520 ÷ 8 = 6315) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50520 ÷ 10 = 5052) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50520 ÷ 12 = 4210) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50520 a prime number?
No. 50520 = × 3 × 5 × 421, so it is divisible by 2.
What are the factors of 50520?
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120, 421, 842, 1263, 1684, 2105, 2526, 3368, 4210, 5052, 6315, 8420, 10104, 12630, 16840, 25260, 50520.
What is 50520 in binary?
1100010101011000 (hexadecimal C558, octal 142530).
What is the square root of 50520?
About 224.7665, exactly 2√12630.
Is 50520 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50520?
50520 is a Harshad number: divisible by its digit sum 12.