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