AI & ChatGPT searches , social queriess for PRIMORIAL
Search references for PRIMORIAL. Phrases containing PRIMORIAL
See searches and references containing PRIMORIAL!
Search references for PRIMORIAL. Phrases containing PRIMORIAL
See searches and references containing PRIMORIAL!PRIMORIAL
Product of the first "n" prime numbers
In mathematics, and more particularly in number theory, primorial, denoted by " p n # {\displaystyle p_{n}\#} ", is a function from natural numbers to
Primorial
Prime number that is product of first n primes ± 1
In mathematics, a primorial prime is a prime number of the form pn# ± 1, where pn# is the primorial of pn (i.e. the product of the first n primes). Primality
Primorial_prime
Natural number
29 and preceding 31. 30 is an even, composite, a pronic number, and a primorial. The SI prefix for 1030 is Quetta- (Q), and for 10−30 (i.e., the reciprocal
30_(number)
Natural number
zero 2309 – primorial prime, twin prime with 2311, Mertens function zero, highly cototient number 2310 – fifth primorial 2311 – primorial prime, twin
2000_(number)
Number that remains the same when its digits are reversed
primorial must be at least 1·2·3·5·7·11·13, and 7×11×13 = 1001. Fuller also refers to powers of 1001 as Scheherazade numbers. The smallest primorial containing
Palindromic_number
Natural number
510 = the product of the first seven prime numbers, thus the seventh primorial. It is also the product of four consecutive Fibonacci numbers—13, 21,
100,000
Product of prime numbers, plus one
numbers are integers of the form En = pn # + 1, where pn # is the nth primorial (the product of the first n prime numbers). They are named after the ancient
Euclid_number
Natural number
before 30,001. 30029 = primorial prime 30030 = primorial 30031 = smallest composite number which is one more than a primorial 30203 = safe prime 30240
30,000
Number divisible only by 1 and itself
the input to the algorithm has already passed a probabilistic test. The primorial function of n {\displaystyle n} , denoted by n # {\displaystyle n\#}
Prime_number
Product of numbers from 1 to n
including the binomial coefficients, double factorials, falling factorials, primorials, and subfactorials. Implementations of the factorial function are commonly
Factorial
Natural number
number 7,163,627,708,162 : 172nd Markov number 7,420,738,134,810 : 12th primorial 7,625,597,484,987 = 196833 = 279 = 327 = 333 = 33 = 23, megafugathree
1,000,000,000,000
Analytic function in mathematics
{(p_{r-1}\#)^{k}}{J_{k}(p_{r}\#)}}\qquad k=2,3,\ldots .} Here pn# is the primorial sequence and Jk is Jordan's totient function. The function ζ can be represented
Riemann_zeta_function
Natural number
arithmetic progression of n primes (in this case, n = 7) that is not a primorial (a product of the first m primes). The sum of Euler's totient function
150_(number)
Base-4 numeral system
the localization of prime numbers (the smallest better base being the primorial base six, senary). Quaternary shares with all fixed-radix numeral systems
Quaternary_numeral_system
Numbers with many divisors
\cdots \times 1451} ). More concisely, it is the product of seven distinct primorials: b 0 5 b 1 3 b 2 2 b 4 b 7 b 18 b 229 , {\displaystyle
Highly_composite_number
Inequality relating the primorial to square of the next prime number
theory, Bonse's inequality, named after H. Bonse, relates the size of a primorial to the smallest prime that does not appear in its prime factorization
Bonse's_inequality
Number whose sums of distinct divisors represent all smaller numbers
prime factor in the primorial is less than one of the divisors of the previous primorial. By induction, it follows that every primorial satisfies the characterization
Practical_number
Natural number
February has on a leap year. 29 is the tenth prime number. 29 is the fifth primorial prime, like its twin prime 31. 29 is the smallest positive whole number
29_(number)
983, 991 (OEIS: A006567) Euclid primes are primes p such that p−1 is a primorial. 3, 7, 31, 211, 2311, 200560490131 (OEIS: A018239) Euler irregular primes
List_of_prime_numbers
Mathematical function
\log x\right).} The first Chebyshev function is the logarithm of the primorial of x, denoted x#, as we have ϑ ( x ) = ∑ p ≤ x log p = log ∏ p ≤ x
Chebyshev_function
Natural number
numbers, 23 occurs twice, since adding 23 to either the fifth or eighth primorial gives a prime number (namely 2333 and 9699713). 23 has the distinction
23_(number)
Technique in analytic number theory by Helmut Maier
method first selects a primorial and then constructs an interval in which the distribution of integers coprime to the primorial is well understood. By
Maier's_matrix_method
Natural number
5, and 7), and thus a primorial, where it is the least common multiple of these four prime numbers. 210 is the first primorial number greater than 2 which
210_(number)
Integer named after Reo Fortune
for a given positive integer n, pn# + m is a prime number, where the primorial pn# is the product of the first n prime numbers. For example, to find
Fortunate_number
spam. [citation needed] Factorial number system {1, 2, 3, 4, 5, 6, ...} Primorial number system {2, 3, 5, 7, 11, 13, ...} Quote notation Redundant binary
List_of_numeral_systems
Natural number
451 = 915 6,321,363,049 = 795072 = 18493 = 436 6,469,693,230 : tenth primorial 6,564,120,420 : The 20th Catalan number. 6,590,815,232 = 925 6,659,914
1,000,000,000
Natural number
092,870 = the product of the first nine prime numbers, thus the ninth primorial 225,058,681 = Pell number 225,331,713 = self-descriptive number in base
100,000,000
Natural number
occurs thrice, since adding 61 to either the tenth, twelfth or seventeenth primorial gives a prime number (namely 6,469,693,291; 7,420,738,134,871; and 1,922
61_(number)
Theorem about prime numbers
product of the prime numbers up to 23, more compactly written 23# in primorial notation. On May 17, 2008, Wróblewski and Raanan Chermoni found the first
Green–Tao_theorem
Type of numeral systems
system with successive prime numbers as radix, whose place values are primorial numbers, considered by S. S. Pillai, Richard K. Guy (sequence A049345
Mixed_radix
Number used for counting
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Natural_number
Number equal to the sum of its proper divisors
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Perfect_number
Numbers obtained by adding the two previous ones
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Fibonacci_sequence
Typographic symbol (#)
and B, or of knots A and B in knot theory. In number theory, n# is the primorial of n. In constructive mathematics, # denotes an apartness relation. In
Number_sign
Iterative algorithm on numbers
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Kaprekar's_routine
Natural number
5939, 5953, 5981, 5987} 9,694,845 = Catalan number 9,699,690 = eighth primorial 9,765,625 = 31252 = 255 = 510 9,800,817 = equal to the sum of the seventh
1,000,000
Integer having a non-trivial divisor
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Composite_number
Set of prime numbers linked by a linear relationship
k {\displaystyle k} , then the common difference is a multiple of the primorial k # = 2 ⋅ 3 ⋅ 5 ⋯ j {\displaystyle k\#=2\cdot 3\cdot 5\cdots j} , where
Primes in arithmetic progression
Primes_in_arithmetic_progression
Arithmetic function related to the divisors of an integer
factors of a prime number are 1 and itself. Also, where pn# denotes the primorial, σ 0 ( p n # ) = 2 n {\displaystyle \sigma _{0}(p_{n}\#)=2^{n}} since
Divisor_function
153, 369, 492, 714, 1682, 2107, 2299 (sequence A006145 in the OEIS). A primorial p n # {\displaystyle p_{n}\#} is the product of all primes from 2 to p
Table_of_prime_factors
Natural number
be swapped but turning over is not allowed 200,560,490,130 = eleventh primorial 208,023,278,209 = 28th Motzkin number. 222,222,222,222 = repdigit 225
100,000,000,000
\vert S\vert } ; see | ◻ | {\displaystyle \vert \square \vert } . 2. Primorial: n # {\displaystyle n{}\#} denotes the product of the prime numbers that
Glossary of mathematical symbols
Glossary_of_mathematical_symbols
September 2025[update]. Mathematics: 9,562,633# + 1 is a 4,151,498-digit primorial prime; the largest known as of September 2025[update]. Mathematics: (215
Orders_of_magnitude_(numbers)
Recursive integer sequence
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Catalan_number
Number n where phi(m) is greater than phi(n) for all m greater than n
by David Masser and Peter Man-Kit Shiu in 1986. As they showed, every primorial is sparsely totient. If P(n) is the largest prime factor of n, then lim inf
Sparsely_totient_number
BOINC based volunteer computing project researching prime numbers
prime for n = 0, ..., 25. 23# = 2·3·5·7·11·13·17·19·23 = 223092870, or 23 primorial, is the product of all primes up to 23. Next target of the project was
PrimeGrid
Infinite integer series where the next number is the sum of the two preceding it
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Lucas_number
Type of sequence of prime numbers
general result known on large Cunningham chains to date. q# denotes the primorial 2 × 3 × 5 × 7 × ... × q. As of 2018[update], the longest known Cunningham
Cunningham_chain
Base-12 numeral system
that has four different prime factors is 210; the pattern follows the primorials. However, these numbers are quite large to use as bases, and are far beyond
Duodecimal
Branch of discrete mathematics
factorial · Factorial moment · Factorial number system · Subfactorial · Primorial · Lanczos approximation · Stirling's approximation Structures & arrays
Combinatorics
Integer filtered out using a sieve similar to that of Eratosthenes
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Lucky_number
primality test for Mersenne numbers. “!” is the factorial, “#” is the primorial, and Φ 3 ( x ) {\displaystyle \Phi _{3}(x)} is the third cyclotomic polynomial
List of largest known primes and probable primes
List_of_largest_known_primes_and_probable_primes
Two raised to an integer power
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Power_of_two
Product of an integer with itself
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Square_number
Class of natural numbers with many divisors
# prime factors SHCN n Prime factorization Prime exponents # divisors d(n) Primorial factorization 1 2 2 1 2 2 2 6 2 ⋅ 3 1,1 4 6 3 12 22 ⋅ 3 2,1 6 2 ⋅ 6 4
Superior highly composite number
Superior_highly_composite_number
Ten raised to an integer power
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Power_of_10
Figurate number
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Triangular_number
Number of subsets of a given size
factorial · Factorial moment · Factorial number system · Subfactorial · Primorial · Lanczos approximation · Stirling's approximation Structures & arrays
Binomial_coefficient
Prime number one less or more than a factorial
the average composite run for integers of similar size (see prime gap). Primorial prime Weisstein, Eric W. "Factorial Prime". MathWorld. The Top Twenty:
Factorial_prime
Numbers with a certain property involving recursive summation
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Happy_number
Retrieved 12 June 2016. Sloane, N. J. A. (ed.). "Sequence A114411 (Triple primorial n###)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation
1000_(number)
Prime number of the form 2^n – 1
Mersenne (22p−1 − 1) Wagstaff (2p + 1)/3 Proth (k·2n + 1) Factorial (n! ± 1) Primorial (pn# ± 1) Euclid (pn# + 1) Pythagorean (4n + 1) Pierpont (2m·3n + 1) Quartan
Mersenne_prime
Number, product of consecutive integers
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Pronic_number
Type of Poulet number
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Super-Poulet_number
Integer whose multiples are digit rotations
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Cyclic_number
Algorithm for determining whether a number is prime
{\text{gcd}}\left(p_{m}\#,i\right)=1\}} and p m # {\displaystyle p_{m}\#} is the primorial – the product of the first m {\displaystyle m} primes. For example, consider
Primality_test
Square of a triangular number
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Squared_triangular_number
Numbers parameterizing ways to partition a set
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Stirling numbers of the second kind
Stirling_numbers_of_the_second_kind
Type of number introduced by Mike Keith
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Keith_number
Product of two prime numbers
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Semiprime
Repeatable pattern of differences between prime numbers
a k-tuple to meet the admissibility test, n must be a multiple of the primorial of k. The Skewes numbers for prime k-tuples are an extension of the definition
Prime_k-tuple
Two or more natural numbers with a common abundancy index
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Friendly_number
Numbers that evenly divide powers of 60
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Regular_number
Class of natural numbers
superabundant number is an even integer, and it is a multiple of the k-th primorial p k # . {\displaystyle p_{k}\#.} In fact, the last exponent ak is equal
Superabundant_number
Arithmetic operation
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Exponentiation
Wiki-based programming chrestomathy
triangle (draw) Perfect numbers Permutations Prime numbers (102 tasks) Primorial numbers Quaternions Quine Random numbers Rock-paper-scissors (play) Roman
Rosetta_Code
10241, 22529, 49153, 106497, ... Cn = n⋅2n + 1, with n ≥ 0. A002064 Primorials pn# 1, 2, 6, 30, 210, 2310, 30030, 510510, 9699690, 223092870, ... pn#
List_of_integer_sequences
recent times. According to Poe, the initial state of matter was a single "Primorial Particle". "Divine Volition", manifesting itself as a repulsive force
History of the Big Bang theory
History_of_the_Big_Bang_theory
Numbers whose prime factors all divide the number more than once
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Powerful_number
Numbers k where x - phi(x) = k has many solutions
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Highly_cototient_number
Type of figurate number
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Polygonal_number
lower, rising, upper factorials) Poisson distribution Polygamma function Primorial Proof of Bertrand's postulate Sierpinski triangle Star of David theorem
List of factorial and binomial topics
List_of_factorial_and_binomial_topics
Number that is the result of operation on its own digits
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Friedman_number
Number that is the numerator of the generalized harmonic number H_(n,2)
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Wolstenholme_number
Formula whose values are the prime numbers
{\displaystyle d} runs through all divisors of p n # {\displaystyle p_{n}\#} , the primorial of p n {\displaystyle p_{n}} . This formula should be seen as a recurrence
Formula_for_primes
Solved prime-number problem
{\displaystyle p} to the numerator.) An upper bound is supplied for the primorial function, n # = ∏ p ≤ n p , {\displaystyle n\#=\prod _{p\,\leq \,n}p,}
Proof_of_Bertrand's_postulate
Positive integer that is an integer power of another positive integer
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Perfect_power
Alternate way to define a function in APL
(right fold). (The length of the prefix obtains by comparison with the primorial function ×⍀p.) The second finds the smallest new prime q remaining in
Direct_function
Concatenation of the first n prime numbers
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Smarandache–Wellin_number
Class of series of figurate numbers, each having a central dot
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Centered_polygonal_number
Type of figurate number
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Hexagonal_number
Number with few prime factors
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Almost_prime
Odd number with specific properties
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Sierpiński_number
Number that is more than the sum of its proper divisors
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Deficient_number
Type of figurate number constructed by combining heptagons
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Heptagonal_number
Number that cannot be written as an aliquot sum
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Untouchable_number
Number of paths between grid corners, allowing diagonal steps
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Delannoy_number
Natural number
of Flavius's sieve. 127 is a Fortunate number which is linked to the primorials. 127 is the 31st super prime. The non-printable "Delete" (DEL) control
127_(number)
Mathematical sequence
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Ulam_number
Combinatorial sequence of numbers
Sparsely totient Aliquot sequences Amicable Perfect Sociable Untouchable Primorial Euclid Fortunate Other prime factor or divisor related numbers Blum Cyclic
Dedekind_number
PRIMORIAL
PRIMORIAL
PRIMORIAL
PRIMORIAL
Girl/Female
Arabic, Muslim, Norwegian
Tree of Jannah
Female
English
English name derived from Hebrew Shoshannah, SHANNAH means "lily."
Girl/Female
Welsh
Uncertain origin, but may be derived from the Latin Honorius meaning man of honour, or from the...
Boy/Male
Indian, Punjabi, Sikh
Friendly Prince
Girl/Female
Arabic, Australian, British, Danish, English
Lily Flower; The Flower Lily is a Symbol of Innocence
Boy/Male
Tamil
Indumal | இநà¯à®¤à¯à®®à®²
Lord Shiva
Male
Welsh
Welsh surname transferred to forename use, derived from ap Rhys, PRYCE means "son of Rhys."
Boy/Male
Tamil
Brilliant, Sun God Surya, Bright
Male
Greek
Variant spelling of Greek Baltasar, BALTAZAR means "Ba'al protect the king."
Boy/Male
Native American
hole in the sky.
PRIMORIAL
PRIMORIAL
PRIMORIAL
PRIMORIAL
PRIMORIAL