The number 50640
50640 is a composite number with 40 divisors. Its prime factorisation is × 3 × 5 × 211. Divisors (40): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 40, 48 … 50640.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50640: a Harshad number: divisible by its digit sum 15.
- 2
50640 is composite. Its prime factorisation is
- 3
The divisors add up to 157728; without 50640 itself that is 107088, so 50640 is abundant (107088 is more than 50640). Euler's totient φ(50640) = 13440 numbers up to 50640 share no factor with it.
- 4
The digits of 50640 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50640 = 2^{4} \times 3 \times 5 \times 211 \]50640 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 157728 |
| Euler totient φ(n) | 13440 |
| Square | 2564409600 |
| Cube | 129861702144000 |
| Square root | 225.033331 (= 4√3165) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.064 × |
50640 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and forty |
| Binary (base 2) | 1100010111010000 |
| Octal (base 8) | 142720 |
| Hexadecimal (base 16) | C5D0 |
| Base 3 | 2120110120 |
| As time | 50640 seconds = 14 h 4 min 0 s |
Is 50640 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50640 ÷ 2 = 25320) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50640 ÷ 3 = 16880) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50640 ÷ 4 = 12660) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50640 ÷ 5 = 10128) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50640 ÷ 6 = 8440) | 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 | Yes (50640 ÷ 8 = 6330) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50640 ÷ 10 = 5064) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50640 ÷ 12 = 4220) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50640 a prime number?
No. 50640 = × 3 × 5 × 211, so it is divisible by 2.
What are the factors of 50640?
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 40, 48, 60, 80, 120, 211, 240, 422, 633, 844, 1055, 1266, 1688, 2110, 2532, 3165, 3376, 4220, 5064, 6330, 8440, 10128, 12660, 16880, 25320, 50640.
What is 50640 in binary?
1100010111010000 (hexadecimal C5D0, octal 142720).
What is the square root of 50640?
About 225.0333, exactly 4√3165.
Is 50640 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50640?
50640 is a Harshad number: divisible by its digit sum 15.