Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,879; 200,000,000,010) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,879 = 3 × 7 × 47 × 71 × 1,427
99,999,879 is not a prime number but a composite one.
200,000,000,010 = 2 × 3 × 5 × 19 × 1,627 × 215,659
200,000,000,010 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:
200,000,000,010 ÷ 99,999,879 = 2,000 + 242,010
Step 2. Divide the smaller number by the above operation's remainder:
99,999,879 ÷ 242,010 = 413 + 49,749
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
242,010 ÷ 49,749 = 4 + 43,014
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
49,749 ÷ 43,014 = 1 + 6,735
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
43,014 ÷ 6,735 = 6 + 2,604
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,735 ÷ 2,604 = 2 + 1,527
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,604 ÷ 1,527 = 1 + 1,077
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,527 ÷ 1,077 = 1 + 450
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,077 ÷ 450 = 2 + 177
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
450 ÷ 177 = 2 + 96
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
177 ÷ 96 = 1 + 81
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
96 ÷ 81 = 1 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
81 ÷ 15 = 5 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 6 = 2 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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 (99,999,879; 200,000,000,010) = 3
The two numbers have common prime factors