The number 5260
5260 is a composite number with 12 divisors. Its prime factorisation is × 5 × 263. Divisors (12): 1, 2, 4, 5, 10, 20, 263, 526, 1052, 1315, 2630, 5260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5260 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5260 is composite. Its prime factorisation is
- 3
The divisors add up to 11088; without 5260 itself that is 5828, so 5260 is abundant (5828 is more than 5260). Euler's totient φ(5260) = 2096 numbers up to 5260 share no factor with it.
- 4
The digits of 5260 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 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5260 = 2^{2} \times 5 \times 263 \]5260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 11088 |
| Euler totient φ(n) | 2096 |
| Square | 27667600 |
| Cube | 145531576000 |
| Square root | 72.525857 (= 2√1315) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 54 |
| Scientific notation | 5.26 × |
5260 in other forms
| Form | Value |
|---|---|
| In words | five thousand two hundred and sixty |
| Binary (base 2) | 1010010001100 |
| Octal (base 8) | 12214 |
| Hexadecimal (base 16) | 148C |
| Base 3 | 21012211 |
| As time | 5260 seconds = 1 h 27 min 40 s |
Is 5260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5260 ÷ 2 = 2630) | 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 | Yes (5260 ÷ 4 = 1315) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5260 ÷ 5 = 1052) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5260 ÷ 10 = 526) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5260 a prime number?
No. 5260 = × 5 × 263, so it is divisible by 2.
What are the factors of 5260?
1, 2, 4, 5, 10, 20, 263, 526, 1052, 1315, 2630, 5260.
What is 5260 in binary?
1010010001100 (hexadecimal 148C, octal 12214).
What is the square root of 5260?
About 72.5259, exactly 2√1315.
Is 5260 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 5260?
It is a composite number with 12 divisors.