The number 13260
13260 is a composite number with 48 divisors. Its prime factorisation is × 3 × 5 × 13 × 17. Divisors (48): 1, 2, 3, 4, 5, 6, 10, 12, 13, 15, 17, 20, 26, 30, 34, 39 … 13260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13260: a Harshad number: divisible by its digit sum 12.
- 2
13260 is composite. Its prime factorisation is
- 3
The divisors add up to 42336; without 13260 itself that is 29076, so 13260 is abundant (29076 is more than 13260). Euler's totient φ(13260) = 3072 numbers up to 13260 share no factor with it.
- 4
The digits of 13260 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13260 = 2^{2} \times 3 \times 5 \times 13 \times 17 \]13260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 42336 |
| Euler totient φ(n) | 3072 |
| Square | 175827600 |
| Cube | 2331473976000 |
| Square root | 115.152073 (= 2√3315) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.326 × |
13260 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand two hundred and sixty |
| Binary (base 2) | 11001111001100 |
| Octal (base 8) | 31714 |
| Hexadecimal (base 16) | 33CC |
| Base 3 | 200012010 |
| As time | 13260 seconds = 3 h 41 min 0 s |
Is 13260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13260 ÷ 2 = 6630) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13260 ÷ 3 = 4420) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (13260 ÷ 4 = 3315) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (13260 ÷ 5 = 2652) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (13260 ÷ 6 = 2210) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (13260 ÷ 10 = 1326) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (13260 ÷ 12 = 1105) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13260 a prime number?
No. 13260 = × 3 × 5 × 13 × 17, so it is divisible by 2.
What are the factors of 13260?
1, 2, 3, 4, 5, 6, 10, 12, 13, 15, 17, 20, 26, 30, 34, 39, 51, 52, 60, 65, 68, 78, 85, 102, 130, 156, 170, 195, 204, 221, 255, 260, 340, 390, 442, 510, 663, 780, 884, 1020, 1105, 1326, 2210, 2652, 3315, 4420, 6630, 13260.
What is 13260 in binary?
11001111001100 (hexadecimal 33CC, octal 31714).
What is the square root of 13260?
About 115.1521, exactly 2√3315.
Is 13260 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 13260?
13260 is a Harshad number: divisible by its digit sum 12.