Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,208; 200,000,000,915) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,208 = 24 × 7 × 112 × 47 × 157
100,000,208 is not a prime number but a composite one.
200,000,000,915 = 5 × 11 × 13 × 279,720,281
200,000,000,915 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,915 ÷ 100,000,208 = 1,999 + 99,585,123
Step 2. Divide the smaller number by the above operation's remainder:
100,000,208 ÷ 99,585,123 = 1 + 415,085
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,585,123 ÷ 415,085 = 239 + 379,808
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
415,085 ÷ 379,808 = 1 + 35,277
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
379,808 ÷ 35,277 = 10 + 27,038
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
35,277 ÷ 27,038 = 1 + 8,239
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
27,038 ÷ 8,239 = 3 + 2,321
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,239 ÷ 2,321 = 3 + 1,276
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,321 ÷ 1,276 = 1 + 1,045
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,276 ÷ 1,045 = 1 + 231
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,045 ÷ 231 = 4 + 121
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
231 ÷ 121 = 1 + 110
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
121 ÷ 110 = 1 + 11
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
110 ÷ 11 = 10 + 0
At this step, the remainder is zero, so we stop:
11 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,208; 200,000,000,915) = 11
The two numbers have common prime factors