The number 11001
11001 is a composite number with 8 divisors. Its prime factorisation is 3 × 19 × 193. Divisors (8): 1, 3, 19, 57, 193, 579, 3667, 11001.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11001: a Harshad number: divisible by its digit sum 3.
- 2
11001 is composite. Its prime factorisation is
- 3
The divisors add up to 15520; without 11001 itself that is 4519, so 11001 is deficient (4519 is less than 11001). Euler's totient φ(11001) = 6912 numbers up to 11001 share no factor with it.
- 4
The digits of 11001 add up to 3, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11001 = 3 \times 19 \times 193 \]
11001 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15520 |
| Euler totient φ(n) | 6912 |
| Square | 121022001 |
| Cube | 1331363033001 |
| Square root | 104.885652 |
| Digit sum / digital root | 3 / 3 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1001 × |
11001 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and one |
| Binary (base 2) | 10101011111001 |
| Octal (base 8) | 25371 |
| Hexadecimal (base 16) | 2AF9 |
| Base 3 | 120002110 |
| As time | 11001 seconds = 3 h 3 min 21 s |
Is 11001 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 (11001 ÷ 3 = 3667) | 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 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 | No (remainder 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 11001 a prime number?
No. 11001 = 3 × 19 × 193, so it is divisible by 3.
What are the factors of 11001?
1, 3, 19, 57, 193, 579, 3667, 11001.
What is 11001 in binary?
10101011111001 (hexadecimal 2AF9, octal 25371).
What is the square root of 11001?
About 104.8857.
Is 11001 divisible by 3?
Yes. Its digits add up to 3, a multiple of 3.
What is special about the number 11001?
11001 is a Harshad number: divisible by its digit sum 3.