The number 50140
50140 is a composite number with 24 divisors. Its prime factorisation is × 5 × 23 × 109. Divisors (24): 1, 2, 4, 5, 10, 20, 23, 46, 92, 109, 115, 218, 230, 436, 460, 545 … 50140.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50140: a Harshad number: divisible by its digit sum 10.
- 2
50140 is composite. Its prime factorisation is
- 3
The divisors add up to 110880; without 50140 itself that is 60740, so 50140 is abundant (60740 is more than 50140). Euler's totient φ(50140) = 19008 numbers up to 50140 share no factor with it.
- 4
The digits of 50140 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
\[ 50140 = 2^{2} \times 5 \times 23 \times 109 \]50140 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 110880 |
| Euler totient φ(n) | 19008 |
| Square | 2514019600 |
| Cube | 126052942744000 |
| Square root | 223.919628 (= 2√12535) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.014 × |
50140 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and forty |
| Binary (base 2) | 1100001111011100 |
| Octal (base 8) | 141734 |
| Hexadecimal (base 16) | C3DC |
| Base 3 | 2112210001 |
| As time | 50140 seconds = 13 h 55 min 40 s |
Is 50140 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50140 ÷ 2 = 25070) | 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 (50140 ÷ 4 = 12535) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50140 ÷ 5 = 10028) | 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 6) | 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 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50140 ÷ 10 = 5014) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50140 a prime number?
No. 50140 = × 5 × 23 × 109, so it is divisible by 2.
What are the factors of 50140?
1, 2, 4, 5, 10, 20, 23, 46, 92, 109, 115, 218, 230, 436, 460, 545, 1090, 2180, 2507, 5014, 10028, 12535, 25070, 50140.
What is 50140 in binary?
1100001111011100 (hexadecimal C3DC, octal 141734).
What is the square root of 50140?
About 223.9196, exactly 2√12535.
Is 50140 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 50140?
50140 is a Harshad number: divisible by its digit sum 10.