The number 1271
1271 is a composite number with 4 divisors. Its prime factorisation is 31 × 41. Divisors (4): 1, 31, 41, 1271.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1271: a semiprime: 31 × 41, the product of two primes.
- 2
1271 is composite. Its prime factorisation is
- 3
The divisors add up to 1344; without 1271 itself that is 73, so 1271 is deficient (73 is less than 1271). Euler's totient φ(1271) = 1200 numbers up to 1271 share no factor with it.
- 4
The digits of 1271 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 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1271 = 31 \times 41 \]
1271 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1344 |
| Euler totient φ(n) | 1200 |
| Square | 1615441 |
| Cube | 2053225511 |
| Square root | 35.651087 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.271 × |
1271 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and seventy-one |
| Roman numerals | MCCLXXI |
| Binary (base 2) | 10011110111 |
| Octal (base 8) | 2367 |
| Hexadecimal (base 16) | 4F7 |
| Base 3 | 1202002 |
| As time | 1271 seconds = 21 min 11 s |
Is 1271 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1271 a prime number?
No. 1271 = 31 × 41, so it is divisible by 31.
What are the factors of 1271?
1, 31, 41, 1271.
What is 1271 in binary?
10011110111 (hexadecimal 4F7, octal 2367).
What is the square root of 1271?
About 35.6511.
What is 1271 in Roman numerals?
MCCLXXI.
Is 1271 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1271?
1271 is a semiprime: 31 × 41, the product of two primes.