What is the Greatest Common Factor of 46952 and 46965?

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

GCF(46952,46965) = 1

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

How to find the GCF of 46952 and 46965?

We will first find the prime factorization of 46952 and 46965. After we will calculate the factors of 46952 and 46965 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 46965

Prime factors of 46965 are 3, 5, 31, 101. Prime factorization of 46965 in exponential form is:

46965 = 3¹ × 5¹ × 31¹ × 101¹

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 46965

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

1, 3, 5, 15, 31, 93, 101, 155, 303, 465, 505, 1515, 3131, 9393, 15655

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 46952 and 46965