Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,086; 200,000,001,032) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,086 = 2 × 3 × 17 × 980,393
100,000,086 is not a prime number but a composite one.
200,000,001,032 = 23 × 13 × 239 × 8,046,347
200,000,001,032 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,001,032 ÷ 100,000,086 = 1,999 + 99,829,118
Step 2. Divide the smaller number by the above operation's remainder:
100,000,086 ÷ 99,829,118 = 1 + 170,968
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,829,118 ÷ 170,968 = 583 + 154,774
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
170,968 ÷ 154,774 = 1 + 16,194
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
154,774 ÷ 16,194 = 9 + 9,028
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
16,194 ÷ 9,028 = 1 + 7,166
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,028 ÷ 7,166 = 1 + 1,862
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,166 ÷ 1,862 = 3 + 1,580
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,862 ÷ 1,580 = 1 + 282
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,580 ÷ 282 = 5 + 170
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
282 ÷ 170 = 1 + 112
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
170 ÷ 112 = 1 + 58
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
112 ÷ 58 = 1 + 54
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
58 ÷ 54 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
54 ÷ 4 = 13 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
4 ÷ 2 = 2 + 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,086; 200,000,001,032) = 2
The two numbers have common prime factors