What is the Greatest Common Factor of 84037 and 84048?

Greatest common factor (GCF) of 84037 and 84048 is 1.

GCF(84037,84048) = 1

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

How to find the GCF of 84037 and 84048?

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

Step-1: Prime Factorization of 84037

Prime factors of 84037 are 19, 4423. Prime factorization of 84037 in exponential form is:

84037 = 19¹ × 4423¹

Step-2: Prime Factorization of 84048

Prime factors of 84048 are 2, 3, 17, 103. Prime factorization of 84048 in exponential form is:

84048 = 2⁴ × 3¹ × 17¹ × 103¹

Step-3: Factors of 84037

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

1, 19, 4423

Step-4: Factors of 84048

List of positive integer factors of 84048 that divides 84037 without a remainder.

1, 2, 3, 4, 6, 8, 12, 16, 17, 24, 34, 48, 51, 68, 102, 103, 136, 204, 206, 272, 309, 408, 412, 618, 816, 824, 1236, 1648, 1751, 2472, 3502, 4944, 5253, 7004, 10506, 14008, 21012, 28016, 42024

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84037 and 84048