The number 10260
10260 is a composite number with 48 divisors. Its prime factorisation is × × 5 × 19. Divisors (48): 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 19, 20, 27, 30, 36 … 10260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10260: a Harshad number: divisible by its digit sum 9.
- 2
10260 is composite. Its prime factorisation is
- 3
The divisors add up to 33600; without 10260 itself that is 23340, so 10260 is abundant (23340 is more than 10260). Euler's totient φ(10260) = 2592 numbers up to 10260 share no factor with it.
- 4
The digits of 10260 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10260 = 2^{2} \times 3^{3} \times 5 \times 19 \]10260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 33600 |
| Euler totient φ(n) | 2592 |
| Square | 105267600 |
| Cube | 1080045576000 |
| Square root | 101.291658 (= 6√285) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.026 × |
10260 in other forms
| Form | Value |
|---|---|
| In words | ten thousand two hundred and sixty |
| Binary (base 2) | 10100000010100 |
| Octal (base 8) | 24024 |
| Hexadecimal (base 16) | 2814 |
| Base 3 | 112002000 |
| As time | 10260 seconds = 2 h 51 min 0 s |
Is 10260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10260 ÷ 2 = 5130) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10260 ÷ 3 = 3420) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (10260 ÷ 4 = 2565) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10260 ÷ 5 = 2052) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (10260 ÷ 6 = 1710) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (10260 ÷ 9 = 1140) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10260 ÷ 10 = 1026) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (10260 ÷ 12 = 855) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10260 a prime number?
No. 10260 = × × 5 × 19, so it is divisible by 2.
What are the factors of 10260?
1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 19, 20, 27, 30, 36, 38, 45, 54, 57, 60, 76, 90, 95, 108, 114, 135, 171, 180, 190, 228, 270, 285, 342, 380, 513, 540, 570, 684, 855, 1026, 1140, 1710, 2052, 2565, 3420, 5130, 10260.
What is 10260 in binary?
10100000010100 (hexadecimal 2814, octal 24024).
What is the square root of 10260?
About 101.2917, exactly 6√285.
Is 10260 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 10260?
10260 is a Harshad number: divisible by its digit sum 9.