The number 51271
51271 is a composite number with 8 divisors. Its prime factorisation is 11 × 59 × 79. Divisors (8): 1, 11, 59, 79, 649, 869, 4661, 51271.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51271 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51271 is composite. Its prime factorisation is
- 3
The divisors add up to 57600; without 51271 itself that is 6329, so 51271 is deficient (6329 is less than 51271). Euler's totient φ(51271) = 45240 numbers up to 51271 share no factor with it.
- 4
The digits of 51271 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51271 = 11 \times 59 \times 79 \]
51271 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57600 |
| Euler totient φ(n) | 45240 |
| Square | 2628715441 |
| Cube | 134776869375511 |
| Square root | 226.431005 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1271 × |
51271 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and seventy-one |
| Binary (base 2) | 1100100001000111 |
| Octal (base 8) | 144107 |
| Hexadecimal (base 16) | C847 |
| Base 3 | 2121022221 |
| As time | 51271 seconds = 14 h 14 min 31 s |
Is 51271 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 1) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (51271 ÷ 11 = 4661) | 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 51271 a prime number?
No. 51271 = 11 × 59 × 79, so it is divisible by 11.
What are the factors of 51271?
1, 11, 59, 79, 649, 869, 4661, 51271.
What is 51271 in binary?
1100100001000111 (hexadecimal C847, octal 144107).
What is the square root of 51271?
About 226.4310.
Is 51271 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51271?
It is a composite number with 8 divisors.