The number 50940
50940 is a composite number with 36 divisors. Its prime factorisation is × × 5 × 283. Divisors (36): 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 30, 36, 45, 60 … 50940.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50940: a Harshad number: divisible by its digit sum 18.
- 2
50940 is composite. Its prime factorisation is
- 3
The divisors add up to 155064; without 50940 itself that is 104124, so 50940 is abundant (104124 is more than 50940). Euler's totient φ(50940) = 13536 numbers up to 50940 share no factor with it.
- 4
The digits of 50940 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50940 = 2^{2} \times 3^{2} \times 5 \times 283 \]50940 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 155064 |
| Euler totient φ(n) | 13536 |
| Square | 2594883600 |
| Cube | 132183370584000 |
| Square root | 225.698914 (= 6√1415) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.094 × |
50940 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and forty |
| Binary (base 2) | 1100011011111100 |
| Octal (base 8) | 143374 |
| Hexadecimal (base 16) | C6FC |
| Base 3 | 2120212200 |
| As time | 50940 seconds = 14 h 9 min 0 s |
Is 50940 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50940 ÷ 2 = 25470) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50940 ÷ 3 = 16980) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50940 ÷ 4 = 12735) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50940 ÷ 5 = 10188) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50940 ÷ 6 = 8490) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50940 ÷ 9 = 5660) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50940 ÷ 10 = 5094) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50940 ÷ 12 = 4245) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50940 a prime number?
No. 50940 = × × 5 × 283, so it is divisible by 2.
What are the factors of 50940?
1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 30, 36, 45, 60, 90, 180, 283, 566, 849, 1132, 1415, 1698, 2547, 2830, 3396, 4245, 5094, 5660, 8490, 10188, 12735, 16980, 25470, 50940.
What is 50940 in binary?
1100011011111100 (hexadecimal C6FC, octal 143374).
What is the square root of 50940?
About 225.6989, exactly 6√1415.
Is 50940 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50940?
50940 is a Harshad number: divisible by its digit sum 18.