The number 15007
15007 is a composite number with 4 divisors. Its prime factorisation is 43 × 349. Divisors (4): 1, 43, 349, 15007.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15007: a semiprime: 43 × 349, the product of two primes.
- 2
15007 is composite. Its prime factorisation is
- 3
The divisors add up to 15400; without 15007 itself that is 393, so 15007 is deficient (393 is less than 15007). Euler's totient φ(15007) = 14616 numbers up to 15007 share no factor with it.
- 4
The digits of 15007 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15007 = 43 \times 349 \]
15007 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15400 |
| Euler totient φ(n) | 14616 |
| Square | 225210049 |
| Cube | 3379727205343 |
| Square root | 122.503061 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.5007 × |
15007 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and seven |
| Binary (base 2) | 11101010011111 |
| Octal (base 8) | 35237 |
| Hexadecimal (base 16) | 3A9F |
| Base 3 | 202120211 |
| As time | 15007 seconds = 4 h 10 min 7 s |
Is 15007 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 | No (remainder 1) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15007 a prime number?
No. 15007 = 43 × 349, so it is divisible by 43.
What are the factors of 15007?
1, 43, 349, 15007.
What is 15007 in binary?
11101010011111 (hexadecimal 3A9F, octal 35237).
What is the square root of 15007?
About 122.5031.
Is 15007 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15007?
15007 is a semiprime: 43 × 349, the product of two primes.