The number 50320
50320 is a composite number with 40 divisors. Its prime factorisation is × 5 × 17 × 37. Divisors (40): 1, 2, 4, 5, 8, 10, 16, 17, 20, 34, 37, 40, 68, 74, 80, 85 … 50320.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50320: a Harshad number: divisible by its digit sum 10.
- 2
50320 is composite. Its prime factorisation is
- 3
The divisors add up to 127224; without 50320 itself that is 76904, so 50320 is abundant (76904 is more than 50320). Euler's totient φ(50320) = 18432 numbers up to 50320 share no factor with it.
- 4
The digits of 50320 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50320 = 2^{4} \times 5 \times 17 \times 37 \]50320 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 127224 |
| Euler totient φ(n) | 18432 |
| Square | 2532102400 |
| Cube | 127415392768000 |
| Square root | 224.321198 (= 4√3145) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.032 × |
50320 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and twenty |
| Binary (base 2) | 1100010010010000 |
| Octal (base 8) | 142220 |
| Hexadecimal (base 16) | C490 |
| Base 3 | 2120000201 |
| As time | 50320 seconds = 13 h 58 min 40 s |
Is 50320 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50320 ÷ 2 = 25160) | 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 (50320 ÷ 4 = 12580) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50320 ÷ 5 = 10064) | 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 4) | 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 (50320 ÷ 8 = 6290) | 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 (50320 ÷ 10 = 5032) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50320 a prime number?
No. 50320 = × 5 × 17 × 37, so it is divisible by 2.
What are the factors of 50320?
1, 2, 4, 5, 8, 10, 16, 17, 20, 34, 37, 40, 68, 74, 80, 85, 136, 148, 170, 185, 272, 296, 340, 370, 592, 629, 680, 740, 1258, 1360, 1480, 2516, 2960, 3145, 5032, 6290, 10064, 12580, 25160, 50320.
What is 50320 in binary?
1100010010010000 (hexadecimal C490, octal 142220).
What is the square root of 50320?
About 224.3212, exactly 4√3145.
Is 50320 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 50320?
50320 is a Harshad number: divisible by its digit sum 10.