The number 11064
11064 is a composite number with 16 divisors. Its prime factorisation is × 3 × 461. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 461, 922, 1383, 1844, 2766, 3688, 5532, 11064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11064: a Harshad number: divisible by its digit sum 12.
- 2
11064 is composite. Its prime factorisation is
- 3
The divisors add up to 27720; without 11064 itself that is 16656, so 11064 is abundant (16656 is more than 11064). Euler's totient φ(11064) = 3680 numbers up to 11064 share no factor with it.
- 4
The digits of 11064 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 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11064 = 2^{3} \times 3 \times 461 \]11064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 27720 |
| Euler totient φ(n) | 3680 |
| Square | 122412096 |
| Cube | 1354367430144 |
| Square root | 105.185550 (= 2√2766) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 99 |
| Scientific notation | 1.1064 × |
11064 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and sixty-four |
| Binary (base 2) | 10101100111000 |
| Octal (base 8) | 25470 |
| Hexadecimal (base 16) | 2B38 |
| Base 3 | 120011210 |
| As time | 11064 seconds = 3 h 4 min 24 s |
Is 11064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11064 ÷ 2 = 5532) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11064 ÷ 3 = 3688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11064 ÷ 4 = 2766) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11064 ÷ 6 = 1844) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (11064 ÷ 8 = 1383) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (11064 ÷ 12 = 922) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11064 a prime number?
No. 11064 = × 3 × 461, so it is divisible by 2.
What are the factors of 11064?
1, 2, 3, 4, 6, 8, 12, 24, 461, 922, 1383, 1844, 2766, 3688, 5532, 11064.
What is 11064 in binary?
10101100111000 (hexadecimal 2B38, octal 25470).
What is the square root of 11064?
About 105.1856, exactly 2√2766.
Is 11064 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11064?
11064 is a Harshad number: divisible by its digit sum 12.