The number 61140
61140 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 1019. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 1019, 2038, 3057, 4076 … 61140.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61140: a Harshad number: divisible by its digit sum 12.
- 2
61140 is composite. Its prime factorisation is
- 3
The divisors add up to 171360; without 61140 itself that is 110220, so 61140 is abundant (110220 is more than 61140). Euler's totient φ(61140) = 16288 numbers up to 61140 share no factor with it.
- 4
The digits of 61140 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 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61140 = 2^{2} \times 3 \times 5 \times 1019 \]61140 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 171360 |
| Euler totient φ(n) | 16288 |
| Square | 3738099600 |
| Cube | 228547409544000 |
| Square root | 247.265040 (= 2√15285) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 34 |
| Scientific notation | 6.114 × |
61140 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand one hundred and forty |
| Binary (base 2) | 1110111011010100 |
| Octal (base 8) | 167324 |
| Hexadecimal (base 16) | EED4 |
| Base 3 | 10002212110 |
| As time | 61140 seconds = 16 h 59 min 0 s |
Is 61140 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61140 ÷ 2 = 30570) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (61140 ÷ 3 = 20380) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (61140 ÷ 4 = 15285) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (61140 ÷ 5 = 12228) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (61140 ÷ 6 = 10190) | 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 (61140 ÷ 10 = 6114) | 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 (61140 ÷ 12 = 5095) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61140 a prime number?
No. 61140 = × 3 × 5 × 1019, so it is divisible by 2.
What are the factors of 61140?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 1019, 2038, 3057, 4076, 5095, 6114, 10190, 12228, 15285, 20380, 30570, 61140.
What is 61140 in binary?
1110111011010100 (hexadecimal EED4, octal 167324).
What is the square root of 61140?
About 247.2650, exactly 2√15285.
Is 61140 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 61140?
61140 is a Harshad number: divisible by its digit sum 12.