Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,130; 200,000,001,052) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,130 = 2 × 5 × 421 × 23,753
100,000,130 is not a prime number but a composite one.
200,000,001,052 = 22 × 439 × 113,895,217
200,000,001,052 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,052 ÷ 100,000,130 = 1,999 + 99,741,182
Step 2. Divide the smaller number by the above operation's remainder:
100,000,130 ÷ 99,741,182 = 1 + 258,948
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,741,182 ÷ 258,948 = 385 + 46,202
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
258,948 ÷ 46,202 = 5 + 27,938
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
46,202 ÷ 27,938 = 1 + 18,264
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
27,938 ÷ 18,264 = 1 + 9,674
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
18,264 ÷ 9,674 = 1 + 8,590
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,674 ÷ 8,590 = 1 + 1,084
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
8,590 ÷ 1,084 = 7 + 1,002
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,084 ÷ 1,002 = 1 + 82
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,002 ÷ 82 = 12 + 18
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
82 ÷ 18 = 4 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
18 ÷ 10 = 1 + 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,130; 200,000,001,052) = 2
The two numbers have common prime factors