What is the Greatest Common Factor of 94952 and 94963?

Greatest common factor (GCF) of 94952 and 94963 is 11.

GCF(94952,94963) = 11

We will now calculate the prime factors of 94952 and 94963, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 94952 and 94963.

How to find the GCF of 94952 and 94963?

We will first find the prime factorization of 94952 and 94963. After we will calculate the factors of 94952 and 94963 and find the biggest common factor number .

Step-1: Prime Factorization of 94952

Prime factors of 94952 are 2, 11, 13, 83. Prime factorization of 94952 in exponential form is:

94952 = 2³ × 11¹ × 13¹ × 83¹

Step-2: Prime Factorization of 94963

Prime factors of 94963 are 11, 89, 97. Prime factorization of 94963 in exponential form is:

94963 = 11¹ × 89¹ × 97¹

Step-3: Factors of 94952

List of positive integer factors of 94952 that divides 94952 without a remainder.

1, 2, 4, 8, 11, 13, 22, 26, 44, 52, 83, 88, 104, 143, 166, 286, 332, 572, 664, 913, 1079, 1144, 1826, 2158, 3652, 4316, 7304, 8632, 11869, 23738, 47476

Step-4: Factors of 94963

List of positive integer factors of 94963 that divides 94952 without a remainder.

1, 11, 89, 97, 979, 1067, 8633

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 94952 and 94963. The biggest common factor number is the GCF number.
So the greatest common factor 94952 and 94963 is 11.

Also check out the Least Common Multiple of 94952 and 94963