Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,048; 200,000,000,894) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,048 = 24 × 31 × 37 × 5,449
100,000,048 is not a prime number but a composite one.
200,000,000,894 = 2 × 100,000,000,447
200,000,000,894 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,894 ÷ 100,000,048 = 1,999 + 99,904,942
Step 2. Divide the smaller number by the above operation's remainder:
100,000,048 ÷ 99,904,942 = 1 + 95,106
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,904,942 ÷ 95,106 = 1,050 + 43,642
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
95,106 ÷ 43,642 = 2 + 7,822
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
43,642 ÷ 7,822 = 5 + 4,532
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,822 ÷ 4,532 = 1 + 3,290
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,532 ÷ 3,290 = 1 + 1,242
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,290 ÷ 1,242 = 2 + 806
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,242 ÷ 806 = 1 + 436
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
806 ÷ 436 = 1 + 370
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
436 ÷ 370 = 1 + 66
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
370 ÷ 66 = 5 + 40
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
66 ÷ 40 = 1 + 26
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
40 ÷ 26 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
26 ÷ 14 = 1 + 12
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
14 ÷ 12 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
12 ÷ 2 = 6 + 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,048; 200,000,000,894) = 2
The two numbers have common prime factors