The number 12002
12002 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 353. Divisors (8): 1, 2, 17, 34, 353, 706, 6001, 12002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12002 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12002 is composite. Its prime factorisation is
- 3
The divisors add up to 19116; without 12002 itself that is 7114, so 12002 is deficient (7114 is less than 12002). Euler's totient φ(12002) = 5632 numbers up to 12002 share no factor with it.
- 4
The digits of 12002 add up to 5, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12002 = 2 \times 17 \times 353 \]
12002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19116 |
| Euler totient φ(n) | 5632 |
| Square | 144048004 |
| Cube | 1728864144008 |
| Square root | 109.553640 |
| Digit sum / digital root | 5 / 5 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.2002 × |
12002 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand and two |
| Binary (base 2) | 10111011100010 |
| Octal (base 8) | 27342 |
| Hexadecimal (base 16) | 2EE2 |
| Base 3 | 121110112 |
| As time | 12002 seconds = 3 h 20 min 2 s |
Is 12002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12002 ÷ 2 = 6001) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12002 a prime number?
No. 12002 = 2 × 17 × 353, so it is divisible by 2.
What are the factors of 12002?
1, 2, 17, 34, 353, 706, 6001, 12002.
What is 12002 in binary?
10111011100010 (hexadecimal 2EE2, octal 27342).
What is the square root of 12002?
About 109.5536.
Is 12002 divisible by 3?
No. Its digits add up to 5, which is not a multiple of 3.
What is special about the number 12002?
It is a composite number with 8 divisors.