Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,095; 200,000,000,034) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,095 = 3 × 5 × 13 × 512,821
100,000,095 is not a prime number but a composite one.
200,000,000,034 = 2 × 32 × 11,111,111,113
200,000,000,034 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,034 ÷ 100,000,095 = 1,999 + 99,810,129
Step 2. Divide the smaller number by the above operation's remainder:
100,000,095 ÷ 99,810,129 = 1 + 189,966
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,810,129 ÷ 189,966 = 525 + 77,979
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
189,966 ÷ 77,979 = 2 + 34,008
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
77,979 ÷ 34,008 = 2 + 9,963
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
34,008 ÷ 9,963 = 3 + 4,119
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,963 ÷ 4,119 = 2 + 1,725
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,119 ÷ 1,725 = 2 + 669
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,725 ÷ 669 = 2 + 387
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
669 ÷ 387 = 1 + 282
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
387 ÷ 282 = 1 + 105
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
282 ÷ 105 = 2 + 72
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
105 ÷ 72 = 1 + 33
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
72 ÷ 33 = 2 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
33 ÷ 6 = 5 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 3 = 2 + 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,095; 200,000,000,034) = 3
The two numbers have common prime factors