Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,095; 200,000,000,798) = ?
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,798 = 2 × 13 × 59 × 130,378,097
200,000,000,798 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,798 ÷ 100,000,095 = 1,999 + 99,810,893
Step 2. Divide the smaller number by the above operation's remainder:
100,000,095 ÷ 99,810,893 = 1 + 189,202
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,810,893 ÷ 189,202 = 527 + 101,439
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
189,202 ÷ 101,439 = 1 + 87,763
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
101,439 ÷ 87,763 = 1 + 13,676
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
87,763 ÷ 13,676 = 6 + 5,707
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,676 ÷ 5,707 = 2 + 2,262
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,707 ÷ 2,262 = 2 + 1,183
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,262 ÷ 1,183 = 1 + 1,079
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,183 ÷ 1,079 = 1 + 104
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,079 ÷ 104 = 10 + 39
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
104 ÷ 39 = 2 + 26
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
39 ÷ 26 = 1 + 13
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
26 ÷ 13 = 2 + 0
At this step, the remainder is zero, so we stop:
13 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,798) = 13
The two numbers have common prime factors