The number 15003
15003 is a composite number with 6 divisors. Its prime factorisation is × 1667. Divisors (6): 1, 3, 9, 1667, 5001, 15003.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15003: a Harshad number: divisible by its digit sum 9.
- 2
15003 is composite. Its prime factorisation is
- 3
The divisors add up to 21684; without 15003 itself that is 6681, so 15003 is deficient (6681 is less than 15003). Euler's totient φ(15003) = 9996 numbers up to 15003 share no factor with it.
- 4
The digits of 15003 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15003 = 3^{2} \times 1667 \]15003 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 21684 |
| Euler totient φ(n) | 9996 |
| Square | 225090009 |
| Cube | 3377025405027 |
| Square root | 122.486734 (= 3√1667) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5003 × |
15003 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and three |
| Binary (base 2) | 11101010011011 |
| Octal (base 8) | 35233 |
| Hexadecimal (base 16) | 3A9B |
| Base 3 | 202120200 |
| As time | 15003 seconds = 4 h 10 min 3 s |
Is 15003 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 (15003 ÷ 3 = 5001) | 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 2) | 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 | Yes (15003 ÷ 9 = 1667) | 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 10) | 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 15003 a prime number?
No. 15003 = × 1667, so it is divisible by 3.
What are the factors of 15003?
1, 3, 9, 1667, 5001, 15003.
What is 15003 in binary?
11101010011011 (hexadecimal 3A9B, octal 35233).
What is the square root of 15003?
About 122.4867, exactly 3√1667.
Is 15003 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 15003?
15003 is a Harshad number: divisible by its digit sum 9.