The number 15006
15006 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 41 × 61. Divisors (16): 1, 2, 3, 6, 41, 61, 82, 122, 123, 183, 246, 366, 2501, 5002, 7503, 15006.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15006 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15006 is composite. Its prime factorisation is
- 3
The divisors add up to 31248; without 15006 itself that is 16242, so 15006 is abundant (16242 is more than 15006). Euler's totient φ(15006) = 4800 numbers up to 15006 share no factor with it.
- 4
The digits of 15006 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15006 = 2 \times 3 \times 41 \times 61 \]
15006 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 31248 |
| Euler totient φ(n) | 4800 |
| Square | 225180036 |
| Cube | 3379051620216 |
| Square root | 122.498980 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.5006 × |
15006 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and six |
| Binary (base 2) | 11101010011110 |
| Octal (base 8) | 35236 |
| Hexadecimal (base 16) | 3A9E |
| Base 3 | 202120210 |
| As time | 15006 seconds = 4 h 10 min 6 s |
Is 15006 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15006 ÷ 2 = 7503) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15006 ÷ 3 = 5002) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15006 ÷ 6 = 2501) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15006 a prime number?
No. 15006 = 2 × 3 × 41 × 61, so it is divisible by 2.
What are the factors of 15006?
1, 2, 3, 6, 41, 61, 82, 122, 123, 183, 246, 366, 2501, 5002, 7503, 15006.
What is 15006 in binary?
11101010011110 (hexadecimal 3A9E, octal 35236).
What is the square root of 15006?
About 122.4990.
Is 15006 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15006?
It is a composite number with 16 divisors.