Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (141,796; 156,657,718) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
141,796 = 22 × 35,449
141,796 is not a prime number but a composite one.
156,657,718 = 2 × 7 × 53 × 211,129
156,657,718 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:
156,657,718 ÷ 141,796 = 1,104 + 114,934
Step 2. Divide the smaller number by the above operation's remainder:
141,796 ÷ 114,934 = 1 + 26,862
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
114,934 ÷ 26,862 = 4 + 7,486
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
26,862 ÷ 7,486 = 3 + 4,404
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
7,486 ÷ 4,404 = 1 + 3,082
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,404 ÷ 3,082 = 1 + 1,322
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,082 ÷ 1,322 = 2 + 438
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,322 ÷ 438 = 3 + 8
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
438 ÷ 8 = 54 + 6
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
8 ÷ 6 = 1 + 2
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
6 ÷ 2 = 3 + 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 (141,796; 156,657,718) = 2
The two numbers have common prime factors