Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,164; 200,000,000,726) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,164 = 22 × 3 × 11 × 757,577
100,000,164 is not a prime number but a composite one.
200,000,000,726 = 2 × 100,000,000,363
200,000,000,726 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,726 ÷ 100,000,164 = 1,999 + 99,672,890
Step 2. Divide the smaller number by the above operation's remainder:
100,000,164 ÷ 99,672,890 = 1 + 327,274
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,672,890 ÷ 327,274 = 304 + 181,594
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
327,274 ÷ 181,594 = 1 + 145,680
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
181,594 ÷ 145,680 = 1 + 35,914
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
145,680 ÷ 35,914 = 4 + 2,024
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
35,914 ÷ 2,024 = 17 + 1,506
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,024 ÷ 1,506 = 1 + 518
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,506 ÷ 518 = 2 + 470
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
518 ÷ 470 = 1 + 48
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
470 ÷ 48 = 9 + 38
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
48 ÷ 38 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
38 ÷ 10 = 3 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 8 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 2 = 4 + 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 (100,000,164; 200,000,000,726) = 2
The two numbers have common prime factors