Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (14,155,176; 5,435,818,203) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
14,155,176 = 23 × 3 × 7 × 109 × 773
14,155,176 is not a prime number but a composite one.
5,435,818,203 = 3 × 29 × 62,480,669
5,435,818,203 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:
5,435,818,203 ÷ 14,155,176 = 384 + 230,619
Step 2. Divide the smaller number by the above operation's remainder:
14,155,176 ÷ 230,619 = 61 + 87,417
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
230,619 ÷ 87,417 = 2 + 55,785
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
87,417 ÷ 55,785 = 1 + 31,632
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
55,785 ÷ 31,632 = 1 + 24,153
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
31,632 ÷ 24,153 = 1 + 7,479
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
24,153 ÷ 7,479 = 3 + 1,716
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,479 ÷ 1,716 = 4 + 615
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,716 ÷ 615 = 2 + 486
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
615 ÷ 486 = 1 + 129
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
486 ÷ 129 = 3 + 99
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
129 ÷ 99 = 1 + 30
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
99 ÷ 30 = 3 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
30 ÷ 9 = 3 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 3 = 3 + 0
At this step, the remainder is zero, so we stop:
3 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 (14,155,176; 5,435,818,203) = 3
The two numbers have common prime factors