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