enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Table of prime factors - Wikipedia

    en.wikipedia.org/wiki/Table_of_prime_factors

    All integers are either even or odd. A square has even multiplicity for all prime factors (it is of the form a 2 for some a). The first: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144 (sequence A000290 in the OEIS). A cube has all multiplicities divisible by 3 (it is of the form a 3 for some a).

  3. List of prime numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_prime_numbers

    All prime numbers from 31 to 6,469,693,189 for free download. Lists of Primes at the Prime Pages. The Nth Prime Page Nth prime through n=10^12, pi(x) through x=3*10^13, Random primes in same range. Interface to a list of the first 98 million primes (primes less than 2,000,000,000) Weisstein, Eric W. "Prime Number Sequences". MathWorld.

  4. Table of divisors - Wikipedia

    en.wikipedia.org/wiki/Table_of_divisors

    The tables below list all of the divisors of the numbers 1 to 1000. A divisor of an integer n is an integer m, for which n/m is again an integer (which is necessarily also a divisor of n). For example, 3 is a divisor of 21, since 21/7 = 3 (and therefore 7 is also a divisor of 21). If m is a divisor of n, then so is −m. The tables below only ...

  5. List of numbers - Wikipedia, the free encyclopedia

    en.wikipedia.org/wiki/List_of_numbers

    A list of articles about numbers (not about numerals). Topics include powers of ten, notable integers, prime and cardinal numbers, and the myriad system.

  6. 90 (number) - Wikipedia

    en.wikipedia.org/wiki/90_(number)

    90 is the only number to have an aliquot sum of 144 = 12 2. Only three numbers have a set of divisors that generate a sum equal to 90, they are 40, 58, and 89. [3] 90 is also the twentieth abundant [4] and highly abundant [5] number (with 20 the first primitive abundant number and 70 the second). [6] The number of divisors of 90 is 12. [7]

  7. Integer factorization - Wikipedia

    en.wikipedia.org/wiki/Integer_factorization

    If one of the factors is composite, it can in turn be written as a product of smaller factors, for example 60 = 3 · 20 = 3 · (5 · 4). Continuing this process until every factor is prime is called prime factorization; the result is always unique up to the order of the factors by the prime factorization theorem.

  8. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    A positive integer n for which there is an e > 0 such that ⁠ d(n) / n e ⁠ ≥ ⁠ d(k) / k e ⁠ for all k > 1. A002201: Pronic numbers: 0, 2, 6, 12, 20, 30, 42, 56, 72, 90, ... a(n) = 2t(n) = n(n + 1), with n ≥ 0 where t(n) are the triangular numbers. A002378: Markov numbers: 1, 2, 5, 13, 29, 34, 89, 169, 194, ... Positive integer ...

  9. List of Mersenne primes and perfect numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_Mersenne_primes...

    The following is a list of all currently known Mersenne primes and perfect numbers, along with their corresponding exponents p. As of 2024, there are 52 known Mersenne primes (and therefore perfect numbers), the largest 18 of which have been discovered by the distributed computing project Great Internet Mersenne Prime Search, or GIMPS. [2]