Properties of the Number 74093

Seventy-Four Thousand Ninety-Three

Basics

Value: 74092 → 74093 → 74094

Parity: odd

Prime: Yes

Previous Prime: 74077

Next Prime: 74099

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 74093

Divisors: 1, 74093

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10010000101101101

Octal: 220555

Duodecimal: 36A65

Hexadecimal: 1216d

Square: 5489772649

Square Root: 272.2002939013843

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Primes of the form 2n²+14n+5. A154577

Increasing sequence of primes p such that all of 2,3,5,...,prime(n) are primitive roots mod p. A213052

a(n) = n³ + 5. A84381

Let p = n-th odd prime. Then a(n) = least prime congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p. A1992

Let p = n-th odd prime. Then a(n) = least positive integer congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p. A94847

Records in A094847. A94849

Records in A001992. A94852

a(n) gives least prime for which the n-th prime is the least prime which is not a primitive root of a(n) (see A060084), or 0 if the n-th prime never occurs in A060084. A60085

Least prime p such that the first n primes are not squares mod p. A191089

a(n) is the least prime p = prime(k) > prime(n) such that A306530(k) = prime(n). A307965