Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,077; 200,000,000,301) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,077 = 3 × 33,333,359
100,000,077 is not a prime number but a composite one.
200,000,000,301 = 3 × 23 × 757 × 809 × 4,733
200,000,000,301 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,301 ÷ 100,000,077 = 1,999 + 99,846,378
Step 2. Divide the smaller number by the above operation's remainder:
100,000,077 ÷ 99,846,378 = 1 + 153,699
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,846,378 ÷ 153,699 = 649 + 95,727
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
153,699 ÷ 95,727 = 1 + 57,972
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
95,727 ÷ 57,972 = 1 + 37,755
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
57,972 ÷ 37,755 = 1 + 20,217
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
37,755 ÷ 20,217 = 1 + 17,538
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
20,217 ÷ 17,538 = 1 + 2,679
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
17,538 ÷ 2,679 = 6 + 1,464
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,679 ÷ 1,464 = 1 + 1,215
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,464 ÷ 1,215 = 1 + 249
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,215 ÷ 249 = 4 + 219
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
249 ÷ 219 = 1 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
219 ÷ 30 = 7 + 9
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 9 = 3 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
9 ÷ 3 = 3 + 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 (100,000,077; 200,000,000,301) = 3
The two numbers have common prime factors