Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,068; 200,000,001,026) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,068 = 22 × 3 × 7 × 1,190,477
100,000,068 is not a prime number but a composite one.
200,000,001,026 = 2 × 74 × 41,649,313
200,000,001,026 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,001,026 ÷ 100,000,068 = 1,999 + 99,865,094
Step 2. Divide the smaller number by the above operation's remainder:
100,000,068 ÷ 99,865,094 = 1 + 134,974
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,865,094 ÷ 134,974 = 739 + 119,308
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
134,974 ÷ 119,308 = 1 + 15,666
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
119,308 ÷ 15,666 = 7 + 9,646
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,666 ÷ 9,646 = 1 + 6,020
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,646 ÷ 6,020 = 1 + 3,626
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,020 ÷ 3,626 = 1 + 2,394
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,626 ÷ 2,394 = 1 + 1,232
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,394 ÷ 1,232 = 1 + 1,162
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,232 ÷ 1,162 = 1 + 70
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,162 ÷ 70 = 16 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
70 ÷ 42 = 1 + 28
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 28 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
28 ÷ 14 = 2 + 0
At this step, the remainder is zero, so we stop:
14 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,068; 200,000,001,026) = 14 = 2 × 7
The two numbers have common prime factors