Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,065; 200,000,000,670) = ?
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,670 = 2 × 3 × 5 × 9,311 × 715,999
200,000,000,670 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,670 ÷ 100,000,065 = 1,999 + 99,870,735
Step 2. Divide the smaller number by the above operation's remainder:
100,000,065 ÷ 99,870,735 = 1 + 129,330
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,870,735 ÷ 129,330 = 772 + 27,975
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
129,330 ÷ 27,975 = 4 + 17,430
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
27,975 ÷ 17,430 = 1 + 10,545
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
17,430 ÷ 10,545 = 1 + 6,885
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,545 ÷ 6,885 = 1 + 3,660
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,885 ÷ 3,660 = 1 + 3,225
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,660 ÷ 3,225 = 1 + 435
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,225 ÷ 435 = 7 + 180
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
435 ÷ 180 = 2 + 75
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
180 ÷ 75 = 2 + 30
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
75 ÷ 30 = 2 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
30 ÷ 15 = 2 + 0
At this step, the remainder is zero, so we stop:
15 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,670) = 15 = 3 × 5
The two numbers have common prime factors