The number 11007
11007 is a composite number with 6 divisors. Its prime factorisation is × 1223. Divisors (6): 1, 3, 9, 1223, 3669, 11007.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11007: a Harshad number: divisible by its digit sum 9.
- 2
11007 is composite. Its prime factorisation is
- 3
The divisors add up to 15912; without 11007 itself that is 4905, so 11007 is deficient (4905 is less than 11007). Euler's totient φ(11007) = 7332 numbers up to 11007 share no factor with it.
- 4
The digits of 11007 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 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11007 = 3^{2} \times 1223 \]11007 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 15912 |
| Euler totient φ(n) | 7332 |
| Square | 121154049 |
| Cube | 1333542617343 |
| Square root | 104.914251 (= 3√1223) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 73 |
| Scientific notation | 1.1007 × |
11007 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and seven |
| Binary (base 2) | 10101011111111 |
| Octal (base 8) | 25377 |
| Hexadecimal (base 16) | 2AFF |
| Base 3 | 120002200 |
| As time | 11007 seconds = 3 h 3 min 27 s |
Is 11007 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 (11007 ÷ 3 = 3669) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (11007 ÷ 9 = 1223) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11007 a prime number?
No. 11007 = × 1223, so it is divisible by 3.
What are the factors of 11007?
1, 3, 9, 1223, 3669, 11007.
What is 11007 in binary?
10101011111111 (hexadecimal 2AFF, octal 25377).
What is the square root of 11007?
About 104.9143, exactly 3√1223.
Is 11007 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 11007?
11007 is a Harshad number: divisible by its digit sum 9.