The number 12001
12001 is a composite number with 4 divisors. Its prime factorisation is 11 × 1091. Divisors (4): 1, 11, 1091, 12001.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12001: a semiprime: 11 × 1091, the product of two primes.
- 2
12001 is composite. Its prime factorisation is
- 3
The divisors add up to 13104; without 12001 itself that is 1103, so 12001 is deficient (1103 is less than 12001). Euler's totient φ(12001) = 10900 numbers up to 12001 share no factor with it.
- 4
The digits of 12001 add up to 4, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12001 = 11 \times 1091 \]
12001 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13104 |
| Euler totient φ(n) | 10900 |
| Square | 144024001 |
| Cube | 1728432036001 |
| Square root | 109.549076 |
| Digit sum / digital root | 4 / 4 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.2001 × |
12001 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand and one |
| Binary (base 2) | 10111011100001 |
| Octal (base 8) | 27341 |
| Hexadecimal (base 16) | 2EE1 |
| Base 3 | 121110111 |
| As time | 12001 seconds = 3 h 20 min 1 s |
Is 12001 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 | No (remainder 1) | 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 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | Yes (12001 ÷ 11 = 1091) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12001 a prime number?
No. 12001 = 11 × 1091, so it is divisible by 11.
What are the factors of 12001?
1, 11, 1091, 12001.
What is 12001 in binary?
10111011100001 (hexadecimal 2EE1, octal 27341).
What is the square root of 12001?
About 109.5491.
Is 12001 divisible by 3?
No. Its digits add up to 4, which is not a multiple of 3.
What is special about the number 12001?
12001 is a semiprime: 11 × 1091, the product of two primes.