Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (13,741,784; 38,957,798,886) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
13,741,784 = 23 × 7 × 245,389
13,741,784 is not a prime number but a composite one.
38,957,798,886 = 2 × 3 × 47 × 1,409 × 98,047
38,957,798,886 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:
38,957,798,886 ÷ 13,741,784 = 2,834 + 13,583,030
Step 2. Divide the smaller number by the above operation's remainder:
13,741,784 ÷ 13,583,030 = 1 + 158,754
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
13,583,030 ÷ 158,754 = 85 + 88,940
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
158,754 ÷ 88,940 = 1 + 69,814
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
88,940 ÷ 69,814 = 1 + 19,126
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
69,814 ÷ 19,126 = 3 + 12,436
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,126 ÷ 12,436 = 1 + 6,690
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,436 ÷ 6,690 = 1 + 5,746
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,690 ÷ 5,746 = 1 + 944
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
5,746 ÷ 944 = 6 + 82
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
944 ÷ 82 = 11 + 42
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
82 ÷ 42 = 1 + 40
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
42 ÷ 40 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
40 ÷ 2 = 20 + 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 (13,741,784; 38,957,798,886) = 2
The two numbers have common prime factors