The number 51092
51092 is a composite number with 12 divisors. Its prime factorisation is × 53 × 241. Divisors (12): 1, 2, 4, 53, 106, 212, 241, 482, 964, 12773, 25546, 51092.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51092 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51092 is composite. Its prime factorisation is
- 3
The divisors add up to 91476; without 51092 itself that is 40384, so 51092 is deficient (40384 is less than 51092). Euler's totient φ(51092) = 24960 numbers up to 51092 share no factor with it.
- 4
The digits of 51092 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51092 = 2^{2} \times 53 \times 241 \]51092 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91476 |
| Euler totient φ(n) | 24960 |
| Square | 2610392464 |
| Cube | 133370171770688 |
| Square root | 226.035395 (= 2√12773) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 39 |
| Scientific notation | 5.1092 × |
51092 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and ninety-two |
| Binary (base 2) | 1100011110010100 |
| Octal (base 8) | 143624 |
| Hexadecimal (base 16) | C794 |
| Base 3 | 2121002022 |
| As time | 51092 seconds = 14 h 11 min 32 s |
Is 51092 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51092 ÷ 2 = 25546) | 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 | Yes (51092 ÷ 4 = 12773) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 8) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51092 a prime number?
No. 51092 = × 53 × 241, so it is divisible by 2.
What are the factors of 51092?
1, 2, 4, 53, 106, 212, 241, 482, 964, 12773, 25546, 51092.
What is 51092 in binary?
1100011110010100 (hexadecimal C794, octal 143624).
What is the square root of 51092?
About 226.0354, exactly 2√12773.
Is 51092 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51092?
It is a composite number with 12 divisors.