The number 15260
15260 is a composite number with 24 divisors. Its prime factorisation is × 5 × 7 × 109. Divisors (24): 1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 109, 140, 218, 436, 545 … 15260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15260: a Harshad number: divisible by its digit sum 14.
- 2
15260 is composite. Its prime factorisation is
- 3
The divisors add up to 36960; without 15260 itself that is 21700, so 15260 is abundant (21700 is more than 15260). Euler's totient φ(15260) = 5184 numbers up to 15260 share no factor with it.
- 4
The digits of 15260 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15260 = 2^{2} \times 5 \times 7 \times 109 \]15260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 36960 |
| Euler totient φ(n) | 5184 |
| Square | 232867600 |
| Cube | 3553559576000 |
| Square root | 123.531373 (= 2√3815) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 177 |
| Scientific notation | 1.526 × |
15260 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and sixty |
| Binary (base 2) | 11101110011100 |
| Octal (base 8) | 35634 |
| Hexadecimal (base 16) | 3B9C |
| Base 3 | 202221012 |
| As time | 15260 seconds = 4 h 14 min 20 s |
Is 15260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15260 ÷ 2 = 7630) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15260 ÷ 4 = 3815) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15260 ÷ 5 = 3052) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15260 ÷ 7 = 2180) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15260 ÷ 10 = 1526) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15260 a prime number?
No. 15260 = × 5 × 7 × 109, so it is divisible by 2.
What are the factors of 15260?
1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 109, 140, 218, 436, 545, 763, 1090, 1526, 2180, 3052, 3815, 7630, 15260.
What is 15260 in binary?
11101110011100 (hexadecimal 3B9C, octal 35634).
What is the square root of 15260?
About 123.5314, exactly 2√3815.
Is 15260 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 15260?
15260 is a Harshad number: divisible by its digit sum 14.