What is the Greatest Common Factor of 46952 and 46958?

Greatest common factor (GCF) of 46952 and 46958 is 2.

GCF(46952,46958) = 2

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

How to find the GCF of 46952 and 46958?

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

Step-1: Prime Factorization of 46952

Prime factors of 46952 are 2, 5869. Prime factorization of 46952 in exponential form is:

46952 = 2³ × 5869¹

Step-2: Prime Factorization of 46958

Prime factors of 46958 are 2, 53, 443. Prime factorization of 46958 in exponential form is:

46958 = 2¹ × 53¹ × 443¹

Step-3: Factors of 46952

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

1, 2, 4, 8, 5869, 11738, 23476

Step-4: Factors of 46958

List of positive integer factors of 46958 that divides 46952 without a remainder.

1, 2, 53, 106, 443, 886, 23479

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 46952 and 46958. The biggest common factor number is the GCF number.
So the greatest common factor 46952 and 46958 is 2.

Also check out the Least Common Multiple of 46952 and 46958