Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (87,878; 999,999,999,760) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
87,878 = 2 × 7 × 6,277
87,878 is not a prime number but a composite one.
999,999,999,760 = 24 × 5 × 113 × 110,619,469
999,999,999,760 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly two factors: 1 and itself.
- Composite number: a natural number that has at least one other factor than 1 and itself.
Calculate the greatest (highest) common factor (divisor):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
999,999,999,760 ÷ 87,878 = 11,379,412 + 32,024
Step 2. Divide the smaller number by the above operation's remainder:
87,878 ÷ 32,024 = 2 + 23,830
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
32,024 ÷ 23,830 = 1 + 8,194
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
23,830 ÷ 8,194 = 2 + 7,442
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
8,194 ÷ 7,442 = 1 + 752
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,442 ÷ 752 = 9 + 674
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
752 ÷ 674 = 1 + 78
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
674 ÷ 78 = 8 + 50
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
78 ÷ 50 = 1 + 28
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
50 ÷ 28 = 1 + 22
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
28 ÷ 22 = 1 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
22 ÷ 6 = 3 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 4 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
4 ÷ 2 = 2 + 0
At this step, the remainder is zero, so we stop:
2 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (87,878; 999,999,999,760) = 2
The two numbers have common prime factors