The number 51082
51082 is a composite number with 4 divisors. Its prime factorisation is 2 × 25541. Divisors (4): 1, 2, 25541, 51082.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51082: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 25541, the product of two primes.
- 2
51082 is composite. Its prime factorisation is
- 3
The divisors add up to 76626; without 51082 itself that is 25544, so 51082 is deficient (25544 is less than 51082). Euler's totient φ(51082) = 25540 numbers up to 51082 share no factor with it.
- 4
The digits of 51082 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51082 = 2 \times 25541 \]
51082 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 76626 |
| Euler totient φ(n) | 25540 |
| Square | 2609370724 |
| Cube | 133291875323368 |
| Square root | 226.013274 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1082 × |
51082 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and eighty-two |
| Binary (base 2) | 1100011110001010 |
| Octal (base 8) | 143612 |
| Hexadecimal (base 16) | C78A |
| Base 3 | 2121001221 |
| As time | 51082 seconds = 14 h 11 min 22 s |
Is 51082 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51082 ÷ 2 = 25541) | 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 | 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 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 7) | 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 9) | 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 51082 a prime number?
No. 51082 = 2 × 25541, so it is divisible by 2.
What are the factors of 51082?
1, 2, 25541, 51082.
What is 51082 in binary?
1100011110001010 (hexadecimal C78A, octal 143612).
What is the square root of 51082?
About 226.0133.
Is 51082 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51082?
51082 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 25541, the product of two primes.