The number 51077
51077 is a composite number with 4 divisors. Its prime factorisation is 13 × 3929. Divisors (4): 1, 13, 3929, 51077.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51077: a semiprime: 13 × 3929, the product of two primes.
- 2
51077 is composite. Its prime factorisation is
- 3
The divisors add up to 55020; without 51077 itself that is 3943, so 51077 is deficient (3943 is less than 51077). Euler's totient φ(51077) = 47136 numbers up to 51077 share no factor with it.
- 4
The digits of 51077 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51077 = 13 \times 3929 \]
51077 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55020 |
| Euler totient φ(n) | 47136 |
| Square | 2608859929 |
| Cube | 133252738593533 |
| Square root | 226.002212 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.1077 × |
51077 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and seventy-seven |
| Binary (base 2) | 1100011110000101 |
| Octal (base 8) | 143605 |
| Hexadecimal (base 16) | C785 |
| Base 3 | 2121001202 |
| As time | 51077 seconds = 14 h 11 min 17 s |
Is 51077 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 1) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51077 a prime number?
No. 51077 = 13 × 3929, so it is divisible by 13.
What are the factors of 51077?
1, 13, 3929, 51077.
What is 51077 in binary?
1100011110000101 (hexadecimal C785, octal 143605).
What is the square root of 51077?
About 226.0022.
Is 51077 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51077?
51077 is a semiprime: 13 × 3929, the product of two primes.