Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,048; 200,000,000,284) = ?
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,284 = 22 × 7 × 7,142,857,153
200,000,000,284 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,284 ÷ 100,000,048 = 1,999 + 99,904,332
Step 2. Divide the smaller number by the above operation's remainder:
100,000,048 ÷ 99,904,332 = 1 + 95,716
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,904,332 ÷ 95,716 = 1,043 + 72,544
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
95,716 ÷ 72,544 = 1 + 23,172
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,544 ÷ 23,172 = 3 + 3,028
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,172 ÷ 3,028 = 7 + 1,976
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,028 ÷ 1,976 = 1 + 1,052
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,976 ÷ 1,052 = 1 + 924
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,052 ÷ 924 = 1 + 128
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
924 ÷ 128 = 7 + 28
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
128 ÷ 28 = 4 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
28 ÷ 16 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 12 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 4 = 3 + 0
At this step, the remainder is zero, so we stop:
4 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,284) = 4 = 22
The two numbers have common prime factors