The number 15060
15060 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 251. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 251, 502, 753, 1004 … 15060.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15060: a Harshad number: divisible by its digit sum 12.
- 2
15060 is composite. Its prime factorisation is
- 3
The divisors add up to 42336; without 15060 itself that is 27276, so 15060 is abundant (27276 is more than 15060). Euler's totient φ(15060) = 4000 numbers up to 15060 share no factor with it.
- 4
The digits of 15060 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15060 = 2^{2} \times 3 \times 5 \times 251 \]15060 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 42336 |
| Euler totient φ(n) | 4000 |
| Square | 226803600 |
| Cube | 3415662216000 |
| Square root | 122.719192 (= 2√3765) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.506 × |
15060 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and sixty |
| Binary (base 2) | 11101011010100 |
| Octal (base 8) | 35324 |
| Hexadecimal (base 16) | 3AD4 |
| Base 3 | 202122210 |
| As time | 15060 seconds = 4 h 11 min 0 s |
Is 15060 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15060 ÷ 2 = 7530) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15060 ÷ 3 = 5020) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15060 ÷ 4 = 3765) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15060 ÷ 5 = 3012) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15060 ÷ 6 = 2510) | 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 4) | 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 | Yes (15060 ÷ 10 = 1506) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (15060 ÷ 12 = 1255) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15060 a prime number?
No. 15060 = × 3 × 5 × 251, so it is divisible by 2.
What are the factors of 15060?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 251, 502, 753, 1004, 1255, 1506, 2510, 3012, 3765, 5020, 7530, 15060.
What is 15060 in binary?
11101011010100 (hexadecimal 3AD4, octal 35324).
What is the square root of 15060?
About 122.7192, exactly 2√3765.
Is 15060 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15060?
15060 is a Harshad number: divisible by its digit sum 12.