36599
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- Numbers whose least quadratic nonresidue (A020649) is 19.at n=12A025027
- Number of partitions satisfying cn(0,5) + cn(1,5) <= cn(2,5) + cn(3,5) and cn(0,5) + cn(4,5) <= cn(2,5) + cn(3,5).at n=44A039886
- Euclid-Mullin sequence (A000945) with initial value a(1)=97 instead of a(1)=2.at n=12A051330
- Primes with 19 as smallest positive primitive root.at n=30A061331
- Values of x in positive integer solutions of x^2 + y^5 = z^3, listed in increasing order of z. (If a z-value occurs twice, list solutions in increasing order of y.)at n=8A070065
- Numbers whose square can be expressed as the signed sum of a fifth power and a cube: z^2 = x^5 + y^3 with gcd(x,y,z)=1.at n=5A103156
- Odd numbers n for which 19 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=18A112078
- Primes with a prime number of partitions into prime parts.at n=35A146949
- Nearest prime to (2^(e^-gamma))^n, where gamma is the Euler-Mascheroni constant.at n=25A235213
- Primes p with pi(p) and pi(p^2) both prime, where pi(.) is given by A000720.at n=37A237659
- a(n) = smallest nonnegative integer solution z to the system of congruences: z == 0 (mod n), z == 1 (mod A038610(n)) if n is in A033948; or z == 0 (mod n), z == -1 (mod A038610(n)) if n is in A033949.at n=15A255979
- Array of complete solutions to the Diophantine equation x^2 + 5^a*11^b = y^3 read by rows (see comment).at n=34A284056
- Positive numbers k such that (10^(k+3)*3277 + 3167)/9 is prime.at n=12A286959
- Prime p1 of consecutive primes p1, p2, where p2 - p1 = 8, and p1, p2 are in different centuries.at n=24A287049
- Primes that can be generated by the concatenation in base 3, in descending order, of two consecutive integers read in base 10.at n=40A287301
- A sequence of integers from an additive problem with prime numbers.at n=32A348472
- Primes that are the sum of all primes in an interval [k,2*k] for some k>=1.at n=32A389113
- Prime numbersat n=3881