Template:Pp-sock
Template:Short description
The tables contain the prime factorization of the natural numbers from 1 to 1000.
When n is a prime number, the prime factorization is just n itself, written in bold below.
The number 1 is called a unit. It has no prime factors and is neither prime nor composite.
Template:More citations needed
Properties
Many properties of a natural number <math>n</math> can be seen or directly computed from the prime factorization of <math>n</math>.
- The multiplicity of a prime factor <math>p</math> of <math>n</math> is the largest exponent <math>m</math> for which <math>p^m</math> divides <math>n</math>. The tables show the multiplicity for each prime factor. If no exponent is written then the multiplicity is <math>1</math> (since <math>p = p^1</math>). The multiplicity of a prime which does not divide <math>n</math> may be called <math>0</math> or may be considered undefined.
- <math>\omega(n)</math> and <math>\Omega(n)</math>, the prime omega functions, count the number of prime factors of a natural number <math>n</math>.
- <math>\omega(n)</math> (little omega) is the number of distinct prime factors of <math>n</math>.
- <math>\Omega(n)</math> (big omega) is the number of prime factors of <math>n</math> counted with multiplicity (so it is the sum of all prime factor multiplicities).
- A prime number has <math>\Omega(n) = \omega(n) = 1</math>. The first: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37 Template:OEIS. There are many special types of prime numbers.
- A composite number has <math>\Omega(n) \ge \omega(n) > 1</math>. The first: 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21 Template:OEIS. All numbers above 1 are either prime or composite. 1 is neither.
- A semiprime has <math>\Omega(n) = 2</math> (so it is composite). The first: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26, 33, 34 Template:OEIS.
- A <math>k</math>-almost prime (for a natural number <math>k</math>) has <math>\Omega(n) = k</math> (so it is composite if <math>k > 1</math>).
- An even number has the prime factor 2. The first: 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24 Template:OEIS.
- An odd number does not have the prime factor 2. The first: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23 Template:OEIS. All integers are either even or odd.
- A square has even multiplicity for all prime factors (it is of the form <math>a^2</math> for some <math>a</math>). The first: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144 Template:OEIS.
- A cube has all multiplicities divisible by 3 (it is of the form <math>a^3</math> for some <math>a</math>). The first: 1, 8, 27, 64, 125, 216, 343, 512, 729, 1000, 1331, 1728 Template:OEIS.
- A perfect power has a common divisor <math>m > 1</math> for all multiplicities (it is of the form <math>a^m</math> for some <math>a > 1</math> and <math>m > 1</math>). The first: 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100 Template:OEIS. 1 is sometimes included.
- A powerful number (also called squarefull) has multiplicity greater than 1 for all its prime factors. The first: 1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 72 Template:OEIS.
- A prime power has only one prime factor, i.e. <math>\omega(n) = 1</math>. The first: 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19 Template:OEIS. 1 is sometimes included.
- An Achilles number is powerful but not a perfect power. The first: 72, 108, 200, 288, 392, 432, 500, 648, 675, 800, 864, 968 Template:OEIS.
- A square-free integer has no prime factor with multiplicity greater than 1. The first: 1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17 Template:OEIS. A number where some but not all prime factors have multiplicity greater than 1 is neither square-free nor squarefull, but squareful.
- The Liouville function <math>\lambda(n)</math> is 1 if <math>\Omega(n)</math> is even, and is -1 if <math>\Omega(n)</math> is odd.
- The Möbius function <math>\mu(n)</math> is 0 if <math>n</math> is not square-free. Otherwise <math>\mu(n)</math> is 1 if <math>\Omega(n)</math> is even, and is −1 if <math>\Omega(n)</math> is odd.
- A sphenic number is square-free and the product of 3 distinct primes, i.e. it has <math>\omega(n) = \Omega(n) = 3</math>. The first: 30, 42, 66, 70, 78, 102, 105, 110, 114, 130, 138, 154 Template:OEIS.
- <math>a_0(n)</math>, sometimes called the integer logarithm, is the sum of primes dividing <math>n</math>, counted with multiplicity. It is an additive function.
- A Ruth-Aaron pair is a pair of two consecutive numbers <math>(n, n+1)</math> with <math>a_0(n) = a_0(n+1)</math>. The first (by <math>n</math> value): 5, 8, 15, 77, 125, 714, 948, 1330, 1520, 1862, 2491, 3248 Template:OEIS. Another definition is where the same prime is only counted once; if so, the first (by <math>n</math> value): 5, 24, 49, 77, 104, 153, 369, 492, 714, 1682, 2107, 2299 Template:OEIS.
- A primorial <math>p_n\#</math> is the product of all primes from 2 to <math>p_n</math>. The first: 2, 6, 30, 210, 2310, 30030, 510510, 9699690, 223092870, 6469693230, 200560490130, 7420738134810 Template:OEIS. <math>1\# = 1</math> is sometimes included.
- A factorial <math>n!</math> is the product of all numbers from 1 to <math>n</math>. The first: 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, 479001600 Template:OEIS. <math>0! = 1</math> is sometimes included.
- A <math>k</math>-smooth number (for a natural number <math>k</math>) has its prime factors <math>\le k</math> (so it is also <math>j</math>-smooth for any <math>j > k</math>).
- <math>m</math> is smoother than <math>n</math> if the largest prime factor of <math>m</math> is less than the largest of <math>n</math>.
- A regular number has no prime factor greater than 5 (so it is 5-smooth). The first: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16 Template:OEIS.
- A <math>k</math>-powersmooth number has all <math>p^m \le k</math> where <math>p</math> is a prime factor with multiplicity <math>m</math>.
- A frugal number has more digits than the number of digits in its prime factorization (when written like the tables below with multiplicities above 1 as exponents). The first in decimal: 125, 128, 243, 256, 343, 512, 625, 729, 1024, 1029, 1215, 1250 Template:OEIS.
- An equidigital number has the same number of digits as its prime factorization. The first in decimal: 1, 2, 3, 5, 7, 10, 11, 13, 14, 15, 16, 17 Template:OEIS.
- An extravagant number has fewer digits than its prime factorization. The first in decimal: 4, 6, 8, 9, 12, 18, 20, 22, 24, 26, 28, 30 Template:OEIS.
- An economical number has been defined as a frugal number, but also as a number that is either frugal or equidigital.
- <math>gcd(m, n)</math> (greatest common divisor of <math>m</math> and <math>n</math>) is the product of all prime factors which are both in <math>m</math> and <math>n</math> (with the smallest multiplicity for <math>m</math> and <math>n</math>).
- <math>m</math> and <math>n</math> are coprime (also called relatively prime) if they have no common prime factors, which implies <math>gcd(m, n) = 1</math>.
- <math>lcm(m, n)</math> (least common multiple of <math>m</math> and <math>n</math>) is the product of all prime factors of <math>m</math> or <math>n</math> (with the largest multiplicity for <math>m</math> or <math>n</math>).
- <math>gcd(m, n) \times lcm(m, n) = m \times n</math>. Finding the prime factors is often harder than computing <math>gcd</math> and <math>lcm</math> using other algorithms which do not require known prime factorization.
- <math>m</math> is a divisor of <math>n</math> (also called <math>m</math> divides <math>n</math>, or <math>n</math> is divisible by <math>m</math>) if all prime factors of <math>m</math> have at least the same multiplicity in <math>n</math>.
- The divisors of <math>n</math> are all products of some or all prime factors of <math>n</math> (including the empty product 1 of no prime factors). The number of divisors can be computed by increasing all multiplicities by 1 and then multiplying them.
Divisors and properties related to divisors are shown in table of divisors.
1 to 100
101 to 200
201 to 300
301 to 400
401 to 500
501 to 600
601 to 700
701 to 800
801 to 900
901 to 1000
See also