The number 77051
77051 is a composite number with 4 divisors. Its prime factorisation is 13 × 5927. Divisors (4): 1, 13, 5927, 77051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 77051: a semiprime: 13 × 5927, the product of two primes.
- 2
77051 is composite. Its prime factorisation is
- 3
The divisors add up to 82992; without 77051 itself that is 5941, so 77051 is deficient (5941 is less than 77051). Euler's totient φ(77051) = 71112 numbers up to 77051 share no factor with it.
- 4
The digits of 77051 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 156 steps to reach 1.
LaTeX source of the formulas on this page
\[ 77051 = 13 \times 5927 \]
77051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 82992 |
| Euler totient φ(n) | 71112 |
| Square | 5936856601 |
| Cube | 457440737963651 |
| Square root | 277.580619 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 156 |
| Scientific notation | 7.7051 × |
77051 in other forms
| Form | Value |
|---|---|
| In words | seventy-seven thousand and fifty-one |
| Binary (base 2) | 10010110011111011 |
| Octal (base 8) | 226373 |
| Hexadecimal (base 16) | 12CFB |
| Base 3 | 10220200202 |
| As time | 77051 seconds = 21 h 24 min 11 s |
Is 77051 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 2) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 77051 a prime number?
No. 77051 = 13 × 5927, so it is divisible by 13.
What are the factors of 77051?
1, 13, 5927, 77051.
What is 77051 in binary?
10010110011111011 (hexadecimal 12CFB, octal 226373).
What is the square root of 77051?
About 277.5806.
Is 77051 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 77051?
77051 is a semiprime: 13 × 5927, the product of two primes.