Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,065; 200,000,000,604) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,065 = 3 × 5 × 11 × 331 × 1,831
100,000,065 is not a prime number but a composite one.
200,000,000,604 = 22 × 3 × 66,467 × 250,751
200,000,000,604 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,604 ÷ 100,000,065 = 1,999 + 99,870,669
Step 2. Divide the smaller number by the above operation's remainder:
100,000,065 ÷ 99,870,669 = 1 + 129,396
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,870,669 ÷ 129,396 = 771 + 106,353
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
129,396 ÷ 106,353 = 1 + 23,043
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
106,353 ÷ 23,043 = 4 + 14,181
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,043 ÷ 14,181 = 1 + 8,862
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,181 ÷ 8,862 = 1 + 5,319
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,862 ÷ 5,319 = 1 + 3,543
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,319 ÷ 3,543 = 1 + 1,776
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,543 ÷ 1,776 = 1 + 1,767
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,776 ÷ 1,767 = 1 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,767 ÷ 9 = 196 + 3
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 3 = 3 + 0
At this step, the remainder is zero, so we stop:
3 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,065; 200,000,000,604) = 3
The two numbers have common prime factors