Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,102; 200,000,000,464) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,102 = 2 × 6,367 × 7,853
100,000,102 is not a prime number but a composite one.
200,000,000,464 = 24 × 11 × 1,136,363,639
200,000,000,464 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,464 ÷ 100,000,102 = 1,999 + 99,796,566
Step 2. Divide the smaller number by the above operation's remainder:
100,000,102 ÷ 99,796,566 = 1 + 203,536
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,796,566 ÷ 203,536 = 490 + 63,926
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
203,536 ÷ 63,926 = 3 + 11,758
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
63,926 ÷ 11,758 = 5 + 5,136
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
11,758 ÷ 5,136 = 2 + 1,486
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,136 ÷ 1,486 = 3 + 678
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,486 ÷ 678 = 2 + 130
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
678 ÷ 130 = 5 + 28
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
130 ÷ 28 = 4 + 18
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
28 ÷ 18 = 1 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
18 ÷ 10 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 8 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,102; 200,000,000,464) = 2
The two numbers have common prime factors