The number 61150
61150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1223. Divisors (12): 1, 2, 5, 10, 25, 50, 1223, 2446, 6115, 12230, 30575, 61150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61150 is composite. Its prime factorisation is
- 3
The divisors add up to 113832; without 61150 itself that is 52682, so 61150 is deficient (52682 is less than 61150). Euler's totient φ(61150) = 24440 numbers up to 61150 share no factor with it.
- 4
The digits of 61150 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 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61150 = 2 \times 5^{2} \times 1223 \]61150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 113832 |
| Euler totient φ(n) | 24440 |
| Square | 3739322500 |
| Cube | 228659570875000 |
| Square root | 247.285260 (= 5√2446) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 197 |
| Scientific notation | 6.115 × |
61150 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand one hundred and fifty |
| Binary (base 2) | 1110111011011110 |
| Octal (base 8) | 167336 |
| Hexadecimal (base 16) | EEDE |
| Base 3 | 10002212211 |
| As time | 61150 seconds = 16 h 59 min 10 s |
Is 61150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61150 ÷ 2 = 30575) | 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 (61150 ÷ 5 = 12230) | 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 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 6) | 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 (61150 ÷ 10 = 6115) | 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 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61150 a prime number?
No. 61150 = 2 × × 1223, so it is divisible by 2.
What are the factors of 61150?
1, 2, 5, 10, 25, 50, 1223, 2446, 6115, 12230, 30575, 61150.
What is 61150 in binary?
1110111011011110 (hexadecimal EEDE, octal 167336).
What is the square root of 61150?
About 247.2853, exactly 5√2446.
Is 61150 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 61150?
It is a composite number with 12 divisors.