Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,100; 200,000,000,152) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,100 = 22 × 52 × 101 × 9,901
100,000,100 is not a prime number but a composite one.
200,000,000,152 = 23 × 1,373 × 18,208,303
200,000,000,152 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,152 ÷ 100,000,100 = 1,999 + 99,800,252
Step 2. Divide the smaller number by the above operation's remainder:
100,000,100 ÷ 99,800,252 = 1 + 199,848
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,800,252 ÷ 199,848 = 499 + 76,100
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
199,848 ÷ 76,100 = 2 + 47,648
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
76,100 ÷ 47,648 = 1 + 28,452
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
47,648 ÷ 28,452 = 1 + 19,196
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28,452 ÷ 19,196 = 1 + 9,256
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
19,196 ÷ 9,256 = 2 + 684
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
9,256 ÷ 684 = 13 + 364
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
684 ÷ 364 = 1 + 320
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
364 ÷ 320 = 1 + 44
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
320 ÷ 44 = 7 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
44 ÷ 12 = 3 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 8 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 4 = 2 + 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,100; 200,000,000,152) = 4 = 22
The two numbers have common prime factors