The number 11061
11061 is a binary palindrome (10101100110101). Its prime factorisation is × 1229. Divisors (6): 1, 3, 9, 1229, 3687, 11061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11061: a binary palindrome (10101100110101); a Harshad number: divisible by its digit sum 9.
- 2
11061 is composite. Its prime factorisation is
- 3
The divisors add up to 15990; without 11061 itself that is 4929, so 11061 is deficient (4929 is less than 11061). Euler's totient φ(11061) = 7368 numbers up to 11061 share no factor with it.
- 4
The digits of 11061 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11061 = 3^{2} \times 1229 \]11061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 15990 |
| Euler totient φ(n) | 7368 |
| Square | 122345721 |
| Cube | 1353266019981 |
| Square root | 105.171289 (= 3√1229) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1061 × |
11061 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and sixty-one |
| Binary (base 2) | 10101100110101 |
| Octal (base 8) | 25465 |
| Hexadecimal (base 16) | 2B35 |
| Base 3 | 120011200 |
| As time | 11061 seconds = 3 h 4 min 21 s |
Is 11061 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 (11061 ÷ 3 = 3687) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (11061 ÷ 9 = 1229) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11061 a prime number?
No. 11061 = × 1229, so it is divisible by 3.
What are the factors of 11061?
1, 3, 9, 1229, 3687, 11061.
What is 11061 in binary?
10101100110101 (hexadecimal 2B35, octal 25465).
What is the square root of 11061?
About 105.1713, exactly 3√1229.
Is 11061 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 11061?
11061 is a binary palindrome (10101100110101); a Harshad number: divisible by its digit sum 9.