The number 61260
61260 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 1021. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 1021, 2042, 3063, 4084 … 61260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61260: a Harshad number: divisible by its digit sum 15.
- 2
61260 is composite. Its prime factorisation is
- 3
The divisors add up to 171696; without 61260 itself that is 110436, so 61260 is abundant (110436 is more than 61260). Euler's totient φ(61260) = 16320 numbers up to 61260 share no factor with it.
- 4
The digits of 61260 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 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61260 = 2^{2} \times 3 \times 5 \times 1021 \]61260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 171696 |
| Euler totient φ(n) | 16320 |
| Square | 3752787600 |
| Cube | 229895768376000 |
| Square root | 247.507576 (= 2√15315) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.126 × |
61260 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand two hundred and sixty |
| Binary (base 2) | 1110111101001100 |
| Octal (base 8) | 167514 |
| Hexadecimal (base 16) | EF4C |
| Base 3 | 10010000220 |
| As time | 61260 seconds = 17 h 1 min 0 s |
Is 61260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61260 ÷ 2 = 30630) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (61260 ÷ 3 = 20420) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (61260 ÷ 4 = 15315) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (61260 ÷ 5 = 12252) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (61260 ÷ 6 = 10210) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (61260 ÷ 10 = 6126) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (61260 ÷ 12 = 5105) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61260 a prime number?
No. 61260 = × 3 × 5 × 1021, so it is divisible by 2.
What are the factors of 61260?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 1021, 2042, 3063, 4084, 5105, 6126, 10210, 12252, 15315, 20420, 30630, 61260.
What is 61260 in binary?
1110111101001100 (hexadecimal EF4C, octal 167514).
What is the square root of 61260?
About 247.5076, exactly 2√15315.
Is 61260 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 61260?
61260 is a Harshad number: divisible by its digit sum 15.