Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,054; 200,000,001,005) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,054 = 2 × 7 × 11 × 127 × 5,113
100,000,054 is not a prime number but a composite one.
200,000,001,005 = 5 × 7 × 41 × 139,372,823
200,000,001,005 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,005 ÷ 100,000,054 = 1,999 + 99,893,059
Step 2. Divide the smaller number by the above operation's remainder:
100,000,054 ÷ 99,893,059 = 1 + 106,995
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,893,059 ÷ 106,995 = 933 + 66,724
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
106,995 ÷ 66,724 = 1 + 40,271
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
66,724 ÷ 40,271 = 1 + 26,453
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
40,271 ÷ 26,453 = 1 + 13,818
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
26,453 ÷ 13,818 = 1 + 12,635
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,818 ÷ 12,635 = 1 + 1,183
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
12,635 ÷ 1,183 = 10 + 805
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,183 ÷ 805 = 1 + 378
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
805 ÷ 378 = 2 + 49
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
378 ÷ 49 = 7 + 35
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
49 ÷ 35 = 1 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
35 ÷ 14 = 2 + 7
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 7 = 2 + 0
At this step, the remainder is zero, so we stop:
7 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,054; 200,000,001,005) = 7
The two numbers have common prime factors