Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,038; 200,000,000,898) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,038 = 2 × 3 × 1,303 × 12,791
100,000,038 is not a prime number but a composite one.
200,000,000,898 = 2 × 32 × 7,753 × 1,433,137
200,000,000,898 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,898 ÷ 100,000,038 = 1,999 + 99,924,936
Step 2. Divide the smaller number by the above operation's remainder:
100,000,038 ÷ 99,924,936 = 1 + 75,102
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,924,936 ÷ 75,102 = 1,330 + 39,276
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,102 ÷ 39,276 = 1 + 35,826
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
39,276 ÷ 35,826 = 1 + 3,450
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
35,826 ÷ 3,450 = 10 + 1,326
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,450 ÷ 1,326 = 2 + 798
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,326 ÷ 798 = 1 + 528
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
798 ÷ 528 = 1 + 270
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
528 ÷ 270 = 1 + 258
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
270 ÷ 258 = 1 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
258 ÷ 12 = 21 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 6 = 2 + 0
At this step, the remainder is zero, so we stop:
6 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,038; 200,000,000,898) = 6 = 2 × 3
The two numbers have common prime factors