Factors of 1,118,130. Calculator of Proper, Improper, Prime and Compound Divisors, if Any

All the factors (divisors) of the number 1,118,130. Connection with the prime factorization of the number

To find all the divisors of the number 1,118,130:

  • 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 1,118,130:

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


1,118,130 = 2 × 3 × 5 × 13 × 47 × 61
1,118,130 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 = (1 + 1) × (1 + 1) × (1 + 1) × (1 + 1) × (1 + 1) × (1 + 1) = 2 × 2 × 2 × 2 × 2 × 2 = 64

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

2. Multiply the prime factors of the number 1,118,130

  • Multiply the prime factors involved in the prime factorization of the number in all their unique combinations, that give different results.
  • 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
prime factor = 5
composite factor = 2 × 3 = 6
composite factor = 2 × 5 = 10
prime factor = 13
composite factor = 3 × 5 = 15
composite factor = 2 × 13 = 26
composite factor = 2 × 3 × 5 = 30
composite factor = 3 × 13 = 39
prime factor = 47
prime factor = 61
composite factor = 5 × 13 = 65
composite factor = 2 × 3 × 13 = 78
composite factor = 2 × 47 = 94
composite factor = 2 × 61 = 122
composite factor = 2 × 5 × 13 = 130
composite factor = 3 × 47 = 141
composite factor = 3 × 61 = 183
composite factor = 3 × 5 × 13 = 195
composite factor = 5 × 47 = 235
composite factor = 2 × 3 × 47 = 282
composite factor = 5 × 61 = 305
composite factor = 2 × 3 × 61 = 366
composite factor = 2 × 3 × 5 × 13 = 390
composite factor = 2 × 5 × 47 = 470
composite factor = 2 × 5 × 61 = 610
composite factor = 13 × 47 = 611
composite factor = 3 × 5 × 47 = 705
composite factor = 13 × 61 = 793
composite factor = 3 × 5 × 61 = 915
This list continues below...

... This list continues from above
composite factor = 2 × 13 × 47 = 1,222
composite factor = 2 × 3 × 5 × 47 = 1,410
composite factor = 2 × 13 × 61 = 1,586
composite factor = 2 × 3 × 5 × 61 = 1,830
composite factor = 3 × 13 × 47 = 1,833
composite factor = 3 × 13 × 61 = 2,379
composite factor = 47 × 61 = 2,867
composite factor = 5 × 13 × 47 = 3,055
composite factor = 2 × 3 × 13 × 47 = 3,666
composite factor = 5 × 13 × 61 = 3,965
composite factor = 2 × 3 × 13 × 61 = 4,758
composite factor = 2 × 47 × 61 = 5,734
composite factor = 2 × 5 × 13 × 47 = 6,110
composite factor = 2 × 5 × 13 × 61 = 7,930
composite factor = 3 × 47 × 61 = 8,601
composite factor = 3 × 5 × 13 × 47 = 9,165
composite factor = 3 × 5 × 13 × 61 = 11,895
composite factor = 5 × 47 × 61 = 14,335
composite factor = 2 × 3 × 47 × 61 = 17,202
composite factor = 2 × 3 × 5 × 13 × 47 = 18,330
composite factor = 2 × 3 × 5 × 13 × 61 = 23,790
composite factor = 2 × 5 × 47 × 61 = 28,670
composite factor = 13 × 47 × 61 = 37,271
composite factor = 3 × 5 × 47 × 61 = 43,005
composite factor = 2 × 13 × 47 × 61 = 74,542
composite factor = 2 × 3 × 5 × 47 × 61 = 86,010
composite factor = 3 × 13 × 47 × 61 = 111,813
composite factor = 5 × 13 × 47 × 61 = 186,355
composite factor = 2 × 3 × 13 × 47 × 61 = 223,626
composite factor = 2 × 5 × 13 × 47 × 61 = 372,710
composite factor = 3 × 5 × 13 × 47 × 61 = 559,065
composite factor = 2 × 3 × 5 × 13 × 47 × 61 = 1,118,130
64 factors (divisors)

What times what is 1,118,130?
What number multiplied by what number equals 1,118,130?

All the combinations of any two natural numbers whose product equals 1,118,130.

1 × 1,118,130 = 1,118,130
2 × 559,065 = 1,118,130
3 × 372,710 = 1,118,130
5 × 223,626 = 1,118,130
6 × 186,355 = 1,118,130
10 × 111,813 = 1,118,130
13 × 86,010 = 1,118,130
15 × 74,542 = 1,118,130
26 × 43,005 = 1,118,130
30 × 37,271 = 1,118,130
39 × 28,670 = 1,118,130
47 × 23,790 = 1,118,130
61 × 18,330 = 1,118,130
65 × 17,202 = 1,118,130
78 × 14,335 = 1,118,130
94 × 11,895 = 1,118,130
122 × 9,165 = 1,118,130
130 × 8,601 = 1,118,130
141 × 7,930 = 1,118,130
183 × 6,110 = 1,118,130
195 × 5,734 = 1,118,130
235 × 4,758 = 1,118,130
282 × 3,965 = 1,118,130
305 × 3,666 = 1,118,130
366 × 3,055 = 1,118,130
390 × 2,867 = 1,118,130
470 × 2,379 = 1,118,130
610 × 1,833 = 1,118,130
611 × 1,830 = 1,118,130
705 × 1,586 = 1,118,130
793 × 1,410 = 1,118,130
915 × 1,222 = 1,118,130
32 unique multiplications

The final answer:
(scroll down)


1,118,130 has 64 factors (divisors):
1; 2; 3; 5; 6; 10; 13; 15; 26; 30; 39; 47; 61; 65; 78; 94; 122; 130; 141; 183; 195; 235; 282; 305; 366; 390; 470; 610; 611; 705; 793; 915; 1,222; 1,410; 1,586; 1,830; 1,833; 2,379; 2,867; 3,055; 3,666; 3,965; 4,758; 5,734; 6,110; 7,930; 8,601; 9,165; 11,895; 14,335; 17,202; 18,330; 23,790; 28,670; 37,271; 43,005; 74,542; 86,010; 111,813; 186,355; 223,626; 372,710; 559,065 and 1,118,130
out of which 6 prime factors: 2; 3; 5; 13; 47 and 61.
Numbers other than 1 that are not prime factors are composite factors (divisors).
1,118,130 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".