Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,070; 200,000,000,814) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,070 = 2 × 5 × 941 × 10,627
100,000,070 is not a prime number but a composite one.
200,000,000,814 = 2 × 3 × 33,333,333,469
200,000,000,814 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,814 ÷ 100,000,070 = 1,999 + 99,860,884
Step 2. Divide the smaller number by the above operation's remainder:
100,000,070 ÷ 99,860,884 = 1 + 139,186
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,860,884 ÷ 139,186 = 717 + 64,522
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
139,186 ÷ 64,522 = 2 + 10,142
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
64,522 ÷ 10,142 = 6 + 3,670
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
10,142 ÷ 3,670 = 2 + 2,802
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,670 ÷ 2,802 = 1 + 868
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,802 ÷ 868 = 3 + 198
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
868 ÷ 198 = 4 + 76
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
198 ÷ 76 = 2 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
76 ÷ 46 = 1 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 30 = 1 + 16
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 16 = 1 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
16 ÷ 14 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 2 = 7 + 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,070; 200,000,000,814) = 2
The two numbers have common prime factors