The number 11271
11271 is a composite number with 12 divisors. Its prime factorisation is 3 × 13 × . Divisors (12): 1, 3, 13, 17, 39, 51, 221, 289, 663, 867, 3757, 11271.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11271 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11271 is composite. Its prime factorisation is
- 3
The divisors add up to 17192; without 11271 itself that is 5921, so 11271 is deficient (5921 is less than 11271). Euler's totient φ(11271) = 6528 numbers up to 11271 share no factor with it.
- 4
The digits of 11271 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11271 = 3 \times 13 \times 17^{2} \]11271 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 17192 |
| Euler totient φ(n) | 6528 |
| Square | 127035441 |
| Cube | 1431816455511 |
| Square root | 106.164966 (= 17√39) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.1271 × |
11271 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and seventy-one |
| Binary (base 2) | 10110000000111 |
| Octal (base 8) | 26007 |
| Hexadecimal (base 16) | 2C07 |
| Base 3 | 120110110 |
| As time | 11271 seconds = 3 h 7 min 51 s |
Is 11271 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 | Yes (11271 ÷ 3 = 3757) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11271 a prime number?
No. 11271 = 3 × 13 × , so it is divisible by 3.
What are the factors of 11271?
1, 3, 13, 17, 39, 51, 221, 289, 663, 867, 3757, 11271.
What is 11271 in binary?
10110000000111 (hexadecimal 2C07, octal 26007).
What is the square root of 11271?
About 106.1650, exactly 17√39.
Is 11271 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11271?
It is a composite number with 12 divisors.