The number 15039
15039 is a composite number with 8 divisors. Its prime factorisation is × 557. Divisors (8): 1, 3, 9, 27, 557, 1671, 5013, 15039.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15039 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15039 is composite. Its prime factorisation is
- 3
The divisors add up to 22320; without 15039 itself that is 7281, so 15039 is deficient (7281 is less than 15039). Euler's totient φ(15039) = 10008 numbers up to 15039 share no factor with it.
- 4
The digits of 15039 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 270 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15039 = 3^{3} \times 557 \]15039 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22320 |
| Euler totient φ(n) | 10008 |
| Square | 226171521 |
| Cube | 3401393504319 |
| Square root | 122.633601 (= 3√1671) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 270 |
| Scientific notation | 1.5039 × |
15039 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and thirty-nine |
| Binary (base 2) | 11101010111111 |
| Octal (base 8) | 35277 |
| Hexadecimal (base 16) | 3ABF |
| Base 3 | 202122000 |
| As time | 15039 seconds = 4 h 10 min 39 s |
Is 15039 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 (15039 ÷ 3 = 5013) | 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 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 3) | 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 | Yes (15039 ÷ 9 = 1671) | 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 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 15039 a prime number?
No. 15039 = × 557, so it is divisible by 3.
What are the factors of 15039?
1, 3, 9, 27, 557, 1671, 5013, 15039.
What is 15039 in binary?
11101010111111 (hexadecimal 3ABF, octal 35277).
What is the square root of 15039?
About 122.6336, exactly 3√1671.
Is 15039 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15039?
It is a composite number with 8 divisors.