Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,365) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,098 = 2 × 32 × 11 × 505,051
100,000,098 is not a prime number but a composite one.
200,000,000,365 = 5 × 112 × 31 × 10,663,823
200,000,000,365 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,365 ÷ 100,000,098 = 1,999 + 99,804,463
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,804,463 = 1 + 195,635
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,804,463 ÷ 195,635 = 510 + 30,613
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,635 ÷ 30,613 = 6 + 11,957
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
30,613 ÷ 11,957 = 2 + 6,699
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
11,957 ÷ 6,699 = 1 + 5,258
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,699 ÷ 5,258 = 1 + 1,441
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,258 ÷ 1,441 = 3 + 935
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,441 ÷ 935 = 1 + 506
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
935 ÷ 506 = 1 + 429
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
506 ÷ 429 = 1 + 77
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
429 ÷ 77 = 5 + 44
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
77 ÷ 44 = 1 + 33
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
44 ÷ 33 = 1 + 11
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
33 ÷ 11 = 3 + 0
At this step, the remainder is zero, so we stop:
11 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,098; 200,000,000,365) = 11
The two numbers have common prime factors