The number 61010
61010 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 6101. Divisors (8): 1, 2, 5, 10, 6101, 12202, 30505, 61010.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61010 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61010 is composite. Its prime factorisation is
- 3
The divisors add up to 109836; without 61010 itself that is 48826, so 61010 is deficient (48826 is less than 61010). Euler's totient φ(61010) = 24400 numbers up to 61010 share no factor with it.
- 4
The digits of 61010 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61010 = 2 \times 5 \times 6101 \]
61010 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 109836 |
| Euler totient φ(n) | 24400 |
| Square | 3722220100 |
| Cube | 227092648301000 |
| Square root | 247.002024 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 60 |
| Scientific notation | 6.101 × |
61010 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand and ten |
| Binary (base 2) | 1110111001010010 |
| Octal (base 8) | 167122 |
| Hexadecimal (base 16) | EE52 |
| Base 3 | 10002200122 |
| As time | 61010 seconds = 16 h 56 min 50 s |
Is 61010 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61010 ÷ 2 = 30505) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (61010 ÷ 5 = 12202) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (61010 ÷ 10 = 6101) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61010 a prime number?
No. 61010 = 2 × 5 × 6101, so it is divisible by 2.
What are the factors of 61010?
1, 2, 5, 10, 6101, 12202, 30505, 61010.
What is 61010 in binary?
1110111001010010 (hexadecimal EE52, octal 167122).
What is the square root of 61010?
About 247.0020.
Is 61010 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 61010?
It is a composite number with 8 divisors.