The number 51140
51140 is a composite number with 12 divisors. Its prime factorisation is × 5 × 2557. Divisors (12): 1, 2, 4, 5, 10, 20, 2557, 5114, 10228, 12785, 25570, 51140.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51140 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51140 is composite. Its prime factorisation is
- 3
The divisors add up to 107436; without 51140 itself that is 56296, so 51140 is abundant (56296 is more than 51140). Euler's totient φ(51140) = 20448 numbers up to 51140 share no factor with it.
- 4
The digits of 51140 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51140 = 2^{2} \times 5 \times 2557 \]51140 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 107436 |
| Euler totient φ(n) | 20448 |
| Square | 2615299600 |
| Cube | 133746421544000 |
| Square root | 226.141549 (= 2√12785) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.114 × |
51140 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and forty |
| Binary (base 2) | 1100011111000100 |
| Octal (base 8) | 143704 |
| Hexadecimal (base 16) | C7C4 |
| Base 3 | 2121011002 |
| As time | 51140 seconds = 14 h 12 min 20 s |
Is 51140 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51140 ÷ 2 = 25570) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (51140 ÷ 4 = 12785) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51140 ÷ 5 = 10228) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51140 ÷ 10 = 5114) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51140 a prime number?
No. 51140 = × 5 × 2557, so it is divisible by 2.
What are the factors of 51140?
1, 2, 4, 5, 10, 20, 2557, 5114, 10228, 12785, 25570, 51140.
What is 51140 in binary?
1100011111000100 (hexadecimal C7C4, octal 143704).
What is the square root of 51140?
About 226.1415, exactly 2√12785.
Is 51140 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 51140?
It is a composite number with 12 divisors.