Factors of 2,000,472. Calculator of Proper, Improper, Prime and Compound Divisors, if Any

All the factors (divisors) of the number 2,000,472. Connection with the prime factorization of the number

To find all the divisors of the number 2,000,472:

  • 1. Decompose the number into prime factors.
  • See how you can find out how many factors (divisors) the number has, without actually calculating them.
  • 2. Multiply the prime factors in all their unique combinations, that yield different results.

1. Carry out the prime factorization of the number 2,000,472:

The prime factorization of a number: finding the prime numbers that multiply together to make that number.


2,000,472 = 23 × 3 × 19 × 41 × 107
2,000,472 is not a prime number but a composite one.


  • Prime number: a natural number that is divisible (divided evenly) only by 1 and itself. A prime number has exactly two factors: 1 and the number itself.
  • Examples of prime numbers: 2 (factors 1, 2), 3 (factors 1, 3), 5 (factors 1, 5), 7 (factors 1, 7), 11 (factors 1, 11), 13 (factors 1, 13), ...
  • Composite number: a natural number that has at least one factor other than 1 and itself. So it is neither a prime number nor 1.
  • Examples of composite numbers: 4 (it has 3 factors: 1, 2, 4), 6 (it has 4 factors: 1, 2, 3, 6), 8 (it has 4 factors: 1, 2, 4, 8), 9 (it has 3 factors: 1, 3, 9), 10 (it has 4 factors: 1, 2, 5, 10), 12 (it has 6 factors: 1, 2, 3, 4, 6, 12), ...
  • » Online calculator. Check whether a number is prime or not. The prime factorization of composite numbers (decomposition into prime factors)


How to count the number of factors of a number?

Without actually finding the factors

  • If a number N is prime factorized as:
    N = am × bk × cz
    where a, b, c are the prime factors and m, k, z are their exponents, natural numbers, ....
  • ...
  • Then the number of factors of the number N can be calculated as:
    n = (m + 1) × (k + 1) × (z + 1)
  • ...
  • In our case, the number of factors is calculated as:
  • n = (3 + 1) × (1 + 1) × (1 + 1) × (1 + 1) × (1 + 1) = 4 × 2 × 2 × 2 × 2 = 64

But to actually calculate the factors, see below...

2. Multiply the prime factors of the number 2,000,472

  • Multiply the prime factors involved in the prime factorization of the number in all their unique combinations, that give different results.
  • Also consider the exponents of these prime factors.
  • Also add 1 to the list of factors (divisors). All the numbers are divisible by 1.

All the factors (divisors) are listed below - in ascending order

The list of factors (divisors):

Numbers other than 1 that are not prime factors are composite factors (divisors).

neither prime nor composite = 1
prime factor = 2
prime factor = 3
composite factor = 22 = 4
composite factor = 2 × 3 = 6
composite factor = 23 = 8
composite factor = 22 × 3 = 12
prime factor = 19
composite factor = 23 × 3 = 24
composite factor = 2 × 19 = 38
prime factor = 41
composite factor = 3 × 19 = 57
composite factor = 22 × 19 = 76
composite factor = 2 × 41 = 82
prime factor = 107
composite factor = 2 × 3 × 19 = 114
composite factor = 3 × 41 = 123
composite factor = 23 × 19 = 152
composite factor = 22 × 41 = 164
composite factor = 2 × 107 = 214
composite factor = 22 × 3 × 19 = 228
composite factor = 2 × 3 × 41 = 246
composite factor = 3 × 107 = 321
composite factor = 23 × 41 = 328
composite factor = 22 × 107 = 428
composite factor = 23 × 3 × 19 = 456
composite factor = 22 × 3 × 41 = 492
composite factor = 2 × 3 × 107 = 642
composite factor = 19 × 41 = 779
composite factor = 23 × 107 = 856
composite factor = 23 × 3 × 41 = 984
composite factor = 22 × 3 × 107 = 1,284
This list continues below...

... This list continues from above
composite factor = 2 × 19 × 41 = 1,558
composite factor = 19 × 107 = 2,033
composite factor = 3 × 19 × 41 = 2,337
composite factor = 23 × 3 × 107 = 2,568
composite factor = 22 × 19 × 41 = 3,116
composite factor = 2 × 19 × 107 = 4,066
composite factor = 41 × 107 = 4,387
composite factor = 2 × 3 × 19 × 41 = 4,674
composite factor = 3 × 19 × 107 = 6,099
composite factor = 23 × 19 × 41 = 6,232
composite factor = 22 × 19 × 107 = 8,132
composite factor = 2 × 41 × 107 = 8,774
composite factor = 22 × 3 × 19 × 41 = 9,348
composite factor = 2 × 3 × 19 × 107 = 12,198
composite factor = 3 × 41 × 107 = 13,161
composite factor = 23 × 19 × 107 = 16,264
composite factor = 22 × 41 × 107 = 17,548
composite factor = 23 × 3 × 19 × 41 = 18,696
composite factor = 22 × 3 × 19 × 107 = 24,396
composite factor = 2 × 3 × 41 × 107 = 26,322
composite factor = 23 × 41 × 107 = 35,096
composite factor = 23 × 3 × 19 × 107 = 48,792
composite factor = 22 × 3 × 41 × 107 = 52,644
composite factor = 19 × 41 × 107 = 83,353
composite factor = 23 × 3 × 41 × 107 = 105,288
composite factor = 2 × 19 × 41 × 107 = 166,706
composite factor = 3 × 19 × 41 × 107 = 250,059
composite factor = 22 × 19 × 41 × 107 = 333,412
composite factor = 2 × 3 × 19 × 41 × 107 = 500,118
composite factor = 23 × 19 × 41 × 107 = 666,824
composite factor = 22 × 3 × 19 × 41 × 107 = 1,000,236
composite factor = 23 × 3 × 19 × 41 × 107 = 2,000,472
64 factors (divisors)

What times what is 2,000,472?
What number multiplied by what number equals 2,000,472?

All the combinations of any two natural numbers whose product equals 2,000,472.

1 × 2,000,472 = 2,000,472
2 × 1,000,236 = 2,000,472
3 × 666,824 = 2,000,472
4 × 500,118 = 2,000,472
6 × 333,412 = 2,000,472
8 × 250,059 = 2,000,472
12 × 166,706 = 2,000,472
19 × 105,288 = 2,000,472
24 × 83,353 = 2,000,472
38 × 52,644 = 2,000,472
41 × 48,792 = 2,000,472
57 × 35,096 = 2,000,472
76 × 26,322 = 2,000,472
82 × 24,396 = 2,000,472
107 × 18,696 = 2,000,472
114 × 17,548 = 2,000,472
123 × 16,264 = 2,000,472
152 × 13,161 = 2,000,472
164 × 12,198 = 2,000,472
214 × 9,348 = 2,000,472
228 × 8,774 = 2,000,472
246 × 8,132 = 2,000,472
321 × 6,232 = 2,000,472
328 × 6,099 = 2,000,472
428 × 4,674 = 2,000,472
456 × 4,387 = 2,000,472
492 × 4,066 = 2,000,472
642 × 3,116 = 2,000,472
779 × 2,568 = 2,000,472
856 × 2,337 = 2,000,472
984 × 2,033 = 2,000,472
1,284 × 1,558 = 2,000,472
32 unique multiplications

The final answer:
(scroll down)


2,000,472 has 64 factors (divisors):
1; 2; 3; 4; 6; 8; 12; 19; 24; 38; 41; 57; 76; 82; 107; 114; 123; 152; 164; 214; 228; 246; 321; 328; 428; 456; 492; 642; 779; 856; 984; 1,284; 1,558; 2,033; 2,337; 2,568; 3,116; 4,066; 4,387; 4,674; 6,099; 6,232; 8,132; 8,774; 9,348; 12,198; 13,161; 16,264; 17,548; 18,696; 24,396; 26,322; 35,096; 48,792; 52,644; 83,353; 105,288; 166,706; 250,059; 333,412; 500,118; 666,824; 1,000,236 and 2,000,472
out of which 5 prime factors: 2; 3; 19; 41 and 107.
Numbers other than 1 that are not prime factors are composite factors (divisors).
2,000,472 and 1 are sometimes called improper factors, the others are called proper factors (proper divisors).

  • A quick way to find the factors (the divisors) of a number is to break it down into prime factors.
  • Then multiply the prime factors and their exponents, if any, in all their different combinations.



Factors (divisors), common factors (common divisors), the greatest common factor, GCF (also called the greatest common divisor, GCD, or the highest common factor, HCF)

  • If the number "t" is a factor (divisor) of the number "a" then in the prime factorization of "t" we will only encounter prime factors that also occur in the prime factorization of "a".
  • If there are exponents involved, the maximum value of an exponent for any base of a power that is found in the prime factorization of "t" (powers, or multiplicities) is at most equal to the exponent of the same base that is involved in the prime factorization of "a".
  • Hint: 23 = 2 × 2 × 2 = 8. 2 is called the base and 3 is the exponent. 23 is the power and 8 is the value of the power. We sometimes say that the number 2 is raised to the power of 3.
  • For example, 12 is a factor (divisor) of 120 - the remainder is zero when dividing 120 by 12.
  • Let's look at the prime factorization of both numbers and notice the bases and the exponents that occur in the prime factorization of both numbers:
  • 12 = 2 × 2 × 3 = 22 × 3
  • 120 = 2 × 2 × 2 × 3 × 5 = 23 × 3 × 5
  • 120 contains all the prime factors of 12, and all its bases' exponents are higher than those of 12.
  • If "t" is a common factor (divisor) of "a" and "b", then the prime factorization of "t" contains only the common prime factors involved in the prime factorizations of both "a" and "b".
  • If there are exponents involved, the maximum value of an exponent for any base of a power that is found in the prime factorization of "t" is at most equal to the minimum of the exponents of the same base that is involved in the prime factorization of both "a" and "b".
  • For example, 12 is the common factor of 48 and 360.
  • The remainder is zero when dividing either 48 or 360 by 12.
  • Here there are the prime factorizations of the three numbers, 12, 48 and 360:
  • 12 = 22 × 3
  • 48 = 24 × 3
  • 360 = 23 × 32 × 5
  • Please note that 48 and 360 have more factors (divisors): 2, 3, 4, 6, 8, 12, 24. Among them, 24 is the greatest common factor, GCF (or the greatest common divisor, GCD, or the highest common factor, HCF) of 48 and 360.
  • The greatest common factor, GCF, of two numbers, "a" and "b", is the product of all the common prime factors involved in the prime factorizations of both "a" and "b", taken by the lowest exponents.
  • Based on this rule it is calculated the greatest common factor, GCF, (or the greatest common divisor GCD, HCF) of several numbers, as shown in the example below...
  • GCF, GCD (1,260; 3,024; 5,544) = ?
  • 1,260 = 22 × 32
  • 3,024 = 24 × 32 × 7
  • 5,544 = 23 × 32 × 7 × 11
  • The common prime factors are:
  • 2 - its lowest exponent (multiplicity) is: min.(2; 3; 4) = 2
  • 3 - its lowest exponent (multiplicity) is: min.(2; 2; 2) = 2
  • GCF, GCD (1,260; 3,024; 5,544) = 22 × 32 = 252
  • Coprime numbers:
  • If two numbers "a" and "b" have no other common factors (divisors) than 1, gfc, gcd, hcf (a; b) = 1, then the numbers "a" and "b" are called coprime (or relatively prime).
  • Factors of the GCF
  • If "a" and "b" are not coprime, then every common factor (divisor) of "a" and "b" is a also a factor (divisor) of the greatest common factor, GCF (greatest common divisor, GCD, highest common factor, HCF) of "a" and "b".