The number 16260
16260 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 271. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 271, 542, 813, 1084 … 16260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16260: a Harshad number: divisible by its digit sum 15.
- 2
16260 is composite. Its prime factorisation is
- 3
The divisors add up to 45696; without 16260 itself that is 29436, so 16260 is abundant (29436 is more than 16260). Euler's totient φ(16260) = 4320 numbers up to 16260 share no factor with it.
- 4
The digits of 16260 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16260 = 2^{2} \times 3 \times 5 \times 271 \]16260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 45696 |
| Euler totient φ(n) | 4320 |
| Square | 264387600 |
| Cube | 4298942376000 |
| Square root | 127.514705 (= 2√4065) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 128 |
| Scientific notation | 1.626 × |
16260 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand two hundred and sixty |
| Binary (base 2) | 11111110000100 |
| Octal (base 8) | 37604 |
| Hexadecimal (base 16) | 3F84 |
| Base 3 | 211022020 |
| As time | 16260 seconds = 4 h 31 min 0 s |
Is 16260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16260 ÷ 2 = 8130) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16260 ÷ 3 = 5420) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16260 ÷ 4 = 4065) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (16260 ÷ 5 = 3252) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (16260 ÷ 6 = 2710) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (16260 ÷ 10 = 1626) | 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 | Yes (16260 ÷ 12 = 1355) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16260 a prime number?
No. 16260 = × 3 × 5 × 271, so it is divisible by 2.
What are the factors of 16260?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 271, 542, 813, 1084, 1355, 1626, 2710, 3252, 4065, 5420, 8130, 16260.
What is 16260 in binary?
11111110000100 (hexadecimal 3F84, octal 37604).
What is the square root of 16260?
About 127.5147, exactly 2√4065.
Is 16260 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 16260?
16260 is a Harshad number: divisible by its digit sum 15.