What is the Greatest Common Factor of 46939 and 46952?

Greatest common factor (GCF) of 46939 and 46952 is 1.

GCF(46939,46952) = 1

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

How to find the GCF of 46939 and 46952?

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

Step-1: Prime Factorization of 46939

Prime factors of 46939 are 73, 643. Prime factorization of 46939 in exponential form is:

46939 = 73¹ × 643¹

Step-2: Prime Factorization of 46952

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

46952 = 2³ × 5869¹

Step-3: Factors of 46939

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

1, 73, 643

Step-4: Factors of 46952

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 46939 and 46952