Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,070; 200,000,000,442) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,070 = 2 × 5 × 941 × 10,627
100,000,070 is not a prime number but a composite one.
200,000,000,442 = 2 × 3 × 11 × 53 × 57,175,529
200,000,000,442 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,442 ÷ 100,000,070 = 1,999 + 99,860,512
Step 2. Divide the smaller number by the above operation's remainder:
100,000,070 ÷ 99,860,512 = 1 + 139,558
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,860,512 ÷ 139,558 = 715 + 76,542
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
139,558 ÷ 76,542 = 1 + 63,016
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
76,542 ÷ 63,016 = 1 + 13,526
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
63,016 ÷ 13,526 = 4 + 8,912
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,526 ÷ 8,912 = 1 + 4,614
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,912 ÷ 4,614 = 1 + 4,298
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,614 ÷ 4,298 = 1 + 316
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,298 ÷ 316 = 13 + 190
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
316 ÷ 190 = 1 + 126
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
190 ÷ 126 = 1 + 64
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
126 ÷ 64 = 1 + 62
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
64 ÷ 62 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
62 ÷ 2 = 31 + 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,070; 200,000,000,442) = 2
The two numbers have common prime factors