Given the Number 1,497,496, Calculate (Find) All the Factors (All the Divisors) of the Number 1,497,496 (the Proper, the Improper and the Prime Factors)

All the factors (divisors) of the number 1,497,496

1. Carry out the prime factorization of the number 1,497,496:

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


1,497,496 = 23 × 7 × 112 × 13 × 17
1,497,496 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.
* Composite number: a natural number that has at least one other factor than 1 and itself.


2. Multiply the prime factors of the number 1,497,496

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):

neither prime nor composite = 1
prime factor = 2
22 = 4
prime factor = 7
23 = 8
prime factor = 11
prime factor = 13
2 × 7 = 14
prime factor = 17
2 × 11 = 22
2 × 13 = 26
22 × 7 = 28
2 × 17 = 34
22 × 11 = 44
22 × 13 = 52
23 × 7 = 56
22 × 17 = 68
7 × 11 = 77
23 × 11 = 88
7 × 13 = 91
23 × 13 = 104
7 × 17 = 119
112 = 121
23 × 17 = 136
11 × 13 = 143
2 × 7 × 11 = 154
2 × 7 × 13 = 182
11 × 17 = 187
13 × 17 = 221
2 × 7 × 17 = 238
2 × 112 = 242
2 × 11 × 13 = 286
22 × 7 × 11 = 308
22 × 7 × 13 = 364
2 × 11 × 17 = 374
2 × 13 × 17 = 442
22 × 7 × 17 = 476
22 × 112 = 484
22 × 11 × 13 = 572
23 × 7 × 11 = 616
23 × 7 × 13 = 728
22 × 11 × 17 = 748
7 × 112 = 847
22 × 13 × 17 = 884
23 × 7 × 17 = 952
23 × 112 = 968
7 × 11 × 13 = 1,001
23 × 11 × 13 = 1,144
This list continues below...

... This list continues from above
7 × 11 × 17 = 1,309
23 × 11 × 17 = 1,496
7 × 13 × 17 = 1,547
112 × 13 = 1,573
2 × 7 × 112 = 1,694
23 × 13 × 17 = 1,768
2 × 7 × 11 × 13 = 2,002
112 × 17 = 2,057
11 × 13 × 17 = 2,431
2 × 7 × 11 × 17 = 2,618
2 × 7 × 13 × 17 = 3,094
2 × 112 × 13 = 3,146
22 × 7 × 112 = 3,388
22 × 7 × 11 × 13 = 4,004
2 × 112 × 17 = 4,114
2 × 11 × 13 × 17 = 4,862
22 × 7 × 11 × 17 = 5,236
22 × 7 × 13 × 17 = 6,188
22 × 112 × 13 = 6,292
23 × 7 × 112 = 6,776
23 × 7 × 11 × 13 = 8,008
22 × 112 × 17 = 8,228
22 × 11 × 13 × 17 = 9,724
23 × 7 × 11 × 17 = 10,472
7 × 112 × 13 = 11,011
23 × 7 × 13 × 17 = 12,376
23 × 112 × 13 = 12,584
7 × 112 × 17 = 14,399
23 × 112 × 17 = 16,456
7 × 11 × 13 × 17 = 17,017
23 × 11 × 13 × 17 = 19,448
2 × 7 × 112 × 13 = 22,022
112 × 13 × 17 = 26,741
2 × 7 × 112 × 17 = 28,798
2 × 7 × 11 × 13 × 17 = 34,034
22 × 7 × 112 × 13 = 44,044
2 × 112 × 13 × 17 = 53,482
22 × 7 × 112 × 17 = 57,596
22 × 7 × 11 × 13 × 17 = 68,068
23 × 7 × 112 × 13 = 88,088
22 × 112 × 13 × 17 = 106,964
23 × 7 × 112 × 17 = 115,192
23 × 7 × 11 × 13 × 17 = 136,136
7 × 112 × 13 × 17 = 187,187
23 × 112 × 13 × 17 = 213,928
2 × 7 × 112 × 13 × 17 = 374,374
22 × 7 × 112 × 13 × 17 = 748,748
23 × 7 × 112 × 13 × 17 = 1,497,496

The final answer:
(scroll down)

1,497,496 has 96 factors (divisors):
1; 2; 4; 7; 8; 11; 13; 14; 17; 22; 26; 28; 34; 44; 52; 56; 68; 77; 88; 91; 104; 119; 121; 136; 143; 154; 182; 187; 221; 238; 242; 286; 308; 364; 374; 442; 476; 484; 572; 616; 728; 748; 847; 884; 952; 968; 1,001; 1,144; 1,309; 1,496; 1,547; 1,573; 1,694; 1,768; 2,002; 2,057; 2,431; 2,618; 3,094; 3,146; 3,388; 4,004; 4,114; 4,862; 5,236; 6,188; 6,292; 6,776; 8,008; 8,228; 9,724; 10,472; 11,011; 12,376; 12,584; 14,399; 16,456; 17,017; 19,448; 22,022; 26,741; 28,798; 34,034; 44,044; 53,482; 57,596; 68,068; 88,088; 106,964; 115,192; 136,136; 187,187; 213,928; 374,374; 748,748 and 1,497,496
out of which 5 prime factors: 2; 7; 11; 13 and 17
1,497,496 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.


Calculate all the divisors (factors) of the given numbers

How to calculate (find) all the factors (divisors) of a number:

Break down the number into prime factors. Then multiply its prime factors in all their unique combinations, that give different results.

To calculate the common factors of two numbers:

The common factors (divisors) of two numbers are all the factors of the greatest common factor, gcf.

Calculate the greatest (highest) common factor (divisor) of the two numbers, gcf (hcf, gcd).

Break down the GCF into prime factors. Then multiply its prime factors in all their unique combinations, that give different results.

The latest 10 sets of calculated factors (divisors): of one number or the common factors of two numbers

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".