What is the Greatest Common Factor of 4952 and 4965?

Greatest common factor (GCF) of 4952 and 4965 is 1.

GCF(4952,4965) = 1

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

How to find the GCF of 4952 and 4965?

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

Step-1: Prime Factorization of 4952

Prime factors of 4952 are 2, 619. Prime factorization of 4952 in exponential form is:

4952 = 2³ × 619¹

Step-2: Prime Factorization of 4965

Prime factors of 4965 are 3, 5, 331. Prime factorization of 4965 in exponential form is:

4965 = 3¹ × 5¹ × 331¹

Step-3: Factors of 4952

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

1, 2, 4, 8, 619, 1238, 2476

Step-4: Factors of 4965

List of positive integer factors of 4965 that divides 4952 without a remainder.

1, 3, 5, 15, 331, 993, 1655

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 4952 and 4965. The biggest common factor number is the GCF number.
So the greatest common factor 4952 and 4965 is 1.

Also check out the Least Common Multiple of 4952 and 4965