367567201

Properties

Appears in sequences

• Primes p such that p-1 is a highly composite number.at n=23A072826
• Smallest prime == 1 mod first n composite numbers.at n=21A075063
• Smallest prime == 1 mod first n composite numbers.at n=22A075063
• Smallest prime == 1 mod first n composite numbers.at n=23A075063
• Primes of the form colossally abundant number + 1.at n=7A176903
• a(n) is the smallest b > 1 such that when c is equal to any of the first n composites the congruence b^(c-1) == 1 (mod c) is satisfied, i.e., smallest b larger than 1 such that any member of the set of smallest n composites is a base-b Fermat pseudoprime.at n=21A309383
• a(n) is the smallest b > 1 such that when c is equal to any of the first n composites the congruence b^(c-1) == 1 (mod c) is satisfied, i.e., smallest b larger than 1 such that any member of the set of smallest n composites is a base-b Fermat pseudoprime.at n=22A309383
• a(n) is the smallest b > 1 such that when c is equal to any of the first n composites the congruence b^(c-1) == 1 (mod c) is satisfied, i.e., smallest b larger than 1 such that any member of the set of smallest n composites is a base-b Fermat pseudoprime.at n=23A309383
• Prime numbersat n=19695244