The number 51127
51127 is a composite number with 8 divisors. Its prime factorisation is 29 × 41 × 43. Divisors (8): 1, 29, 41, 43, 1189, 1247, 1763, 51127.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51127 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51127 is composite. Its prime factorisation is
- 3
The divisors add up to 55440; without 51127 itself that is 4313, so 51127 is deficient (4313 is less than 51127). Euler's totient φ(51127) = 47040 numbers up to 51127 share no factor with it.
- 4
The digits of 51127 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51127 = 29 \times 41 \times 43 \]
51127 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 55440 |
| Euler totient φ(n) | 47040 |
| Square | 2613970129 |
| Cube | 133644450785383 |
| Square root | 226.112804 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 39 |
| Scientific notation | 5.1127 × |
51127 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and twenty-seven |
| Binary (base 2) | 1100011110110111 |
| Octal (base 8) | 143667 |
| Hexadecimal (base 16) | C7B7 |
| Base 3 | 2121010121 |
| As time | 51127 seconds = 14 h 12 min 7 s |
Is 51127 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51127 a prime number?
No. 51127 = 29 × 41 × 43, so it is divisible by 29.
What are the factors of 51127?
1, 29, 41, 43, 1189, 1247, 1763, 51127.
What is 51127 in binary?
1100011110110111 (hexadecimal C7B7, octal 143667).
What is the square root of 51127?
About 226.1128.
Is 51127 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51127?
It is a composite number with 8 divisors.