The number 11081
11081 is a composite number with 4 divisors. Its prime factorisation is 7 × 1583. Divisors (4): 1, 7, 1583, 11081.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11081: a semiprime: 7 × 1583, the product of two primes.
- 2
11081 is composite. Its prime factorisation is
- 3
The divisors add up to 12672; without 11081 itself that is 1591, so 11081 is deficient (1591 is less than 11081). Euler's totient φ(11081) = 9492 numbers up to 11081 share no factor with it.
- 4
The digits of 11081 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 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11081 = 7 \times 1583 \]
11081 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12672 |
| Euler totient φ(n) | 9492 |
| Square | 122788561 |
| Cube | 1360620044441 |
| Square root | 105.266329 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1081 × |
11081 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and eighty-one |
| Binary (base 2) | 10101101001001 |
| Octal (base 8) | 25511 |
| Hexadecimal (base 16) | 2B49 |
| Base 3 | 120012102 |
| As time | 11081 seconds = 3 h 4 min 41 s |
Is 11081 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 1) | 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 | Yes (11081 ÷ 7 = 1583) | 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 1) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11081 a prime number?
No. 11081 = 7 × 1583, so it is divisible by 7.
What are the factors of 11081?
1, 7, 1583, 11081.
What is 11081 in binary?
10101101001001 (hexadecimal 2B49, octal 25511).
What is the square root of 11081?
About 105.2663.
Is 11081 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 11081?
11081 is a semiprime: 7 × 1583, the product of two primes.