Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,070; 200,000,000,458) = ?
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,458 = 2 × 31 × 3,225,806,459
200,000,000,458 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,458 ÷ 100,000,070 = 1,999 + 99,860,528
Step 2. Divide the smaller number by the above operation's remainder:
100,000,070 ÷ 99,860,528 = 1 + 139,542
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,860,528 ÷ 139,542 = 715 + 87,998
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
139,542 ÷ 87,998 = 1 + 51,544
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
87,998 ÷ 51,544 = 1 + 36,454
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
51,544 ÷ 36,454 = 1 + 15,090
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
36,454 ÷ 15,090 = 2 + 6,274
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
15,090 ÷ 6,274 = 2 + 2,542
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,274 ÷ 2,542 = 2 + 1,190
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,542 ÷ 1,190 = 2 + 162
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,190 ÷ 162 = 7 + 56
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
162 ÷ 56 = 2 + 50
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
56 ÷ 50 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
50 ÷ 6 = 8 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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,458) = 2
The two numbers have common prime factors