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