The number 12003
12003 is a composite number with 4 divisors. Its prime factorisation is 3 × 4001. Divisors (4): 1, 3, 4001, 12003.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12003: a semiprime: 3 × 4001, the product of two primes.
- 2
12003 is composite. Its prime factorisation is
- 3
The divisors add up to 16008; without 12003 itself that is 4005, so 12003 is deficient (4005 is less than 12003). Euler's totient φ(12003) = 8000 numbers up to 12003 share no factor with it.
- 4
The digits of 12003 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12003 = 3 \times 4001 \]
12003 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16008 |
| Euler totient φ(n) | 8000 |
| Square | 144072009 |
| Cube | 1729296324027 |
| Square root | 109.558204 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.2003 × |
12003 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand and three |
| Binary (base 2) | 10111011100011 |
| Octal (base 8) | 27343 |
| Hexadecimal (base 16) | 2EE3 |
| Base 3 | 121110120 |
| As time | 12003 seconds = 3 h 20 min 3 s |
Is 12003 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 (12003 ÷ 3 = 4001) | 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 3) | 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 12003 a prime number?
No. 12003 = 3 × 4001, so it is divisible by 3.
What are the factors of 12003?
1, 3, 4001, 12003.
What is 12003 in binary?
10111011100011 (hexadecimal 2EE3, octal 27343).
What is the square root of 12003?
About 109.5582.
Is 12003 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 12003?
12003 is a semiprime: 3 × 4001, the product of two primes.