The number 11272
11272 is a composite number with 8 divisors. Its prime factorisation is × 1409. Divisors (8): 1, 2, 4, 8, 1409, 2818, 5636, 11272.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11272 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11272 is composite. Its prime factorisation is
- 3
The divisors add up to 21150; without 11272 itself that is 9878, so 11272 is deficient (9878 is less than 11272). Euler's totient φ(11272) = 5632 numbers up to 11272 share no factor with it.
- 4
The digits of 11272 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11272 = 2^{3} \times 1409 \]11272 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21150 |
| Euler totient φ(n) | 5632 |
| Square | 127057984 |
| Cube | 1432197595648 |
| Square root | 106.169676 (= 2√2818) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 86 |
| Scientific notation | 1.1272 × |
11272 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and seventy-two |
| Binary (base 2) | 10110000001000 |
| Octal (base 8) | 26010 |
| Hexadecimal (base 16) | 2C08 |
| Base 3 | 120110111 |
| As time | 11272 seconds = 3 h 7 min 52 s |
Is 11272 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11272 ÷ 2 = 5636) | 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 | Yes (11272 ÷ 4 = 2818) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (11272 ÷ 8 = 1409) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11272 a prime number?
No. 11272 = × 1409, so it is divisible by 2.
What are the factors of 11272?
1, 2, 4, 8, 1409, 2818, 5636, 11272.
What is 11272 in binary?
10110000001000 (hexadecimal 2C08, octal 26010).
What is the square root of 11272?
About 106.1697, exactly 2√2818.
Is 11272 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11272?
It is a composite number with 8 divisors.