The number 61492
61492 is a composite number with 6 divisors. Its prime factorisation is × 15373. Divisors (6): 1, 2, 4, 15373, 30746, 61492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61492 is composite. Its prime factorisation is
- 3
The divisors add up to 107618; without 61492 itself that is 46126, so 61492 is deficient (46126 is less than 61492). Euler's totient φ(61492) = 30744 numbers up to 61492 share no factor with it.
- 4
The digits of 61492 add up to 22, 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
\[ 61492 = 2^{2} \times 15373 \]61492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 107618 |
| Euler totient φ(n) | 30744 |
| Square | 3781266064 |
| Cube | 232517612807488 |
| Square root | 247.975805 (= 2√15373) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.1492 × |
61492 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand four hundred and ninety-two |
| Binary (base 2) | 1111000000110100 |
| Octal (base 8) | 170064 |
| Hexadecimal (base 16) | F034 |
| Base 3 | 10010100111 |
| As time | 61492 seconds = 17 h 4 min 52 s |
Is 61492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61492 ÷ 2 = 30746) | 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 | Yes (61492 ÷ 4 = 15373) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 4) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61492 a prime number?
No. 61492 = × 15373, so it is divisible by 2.
What are the factors of 61492?
1, 2, 4, 15373, 30746, 61492.
What is 61492 in binary?
1111000000110100 (hexadecimal F034, octal 170064).
What is the square root of 61492?
About 247.9758, exactly 2√15373.
Is 61492 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 61492?
It is a composite number with 6 divisors.