Properties of the Number 90241

Ninety Thousand Two Hundred Forty-One

Basics

Value: 90240 → 90241 → 90242

Parity: odd

Prime: No

Previous Prime: 90239

Next Prime: 90247

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 31 × 41 × 71

Divisors: 1, 31, 41, 71, 1271, 2201, 2911, 90241

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110000010000001

Octal: 260201

Duodecimal: 44281

Hexadecimal: 16081

Square: 8143438081

Square Root: 300.4013981325653

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

Euler pseudoprimes to base 5: composite integers such that abs(5^{(n - 1}/2)) == 1 mod n. A262052

Structured hexagonal diamond numbers (vertex structure 5). A100178

Base-5 Euler-Jacobi pseudoprimes: odd composite k coprime to 5 such that 5^(k-1/2) == (5/k) (mod n), where (5/k) is the Jacobi symbol (or Kronecker symbol). A375914

Composite numbers k == 1, 9 (mod 10) such that 5^(k-1/2) == 1 (mod k). A375915

Expansion of e.g.f.: exp(arcsin(x)*exp(x)). A12316

Numbers n with property that n² starts and ends with 81. A159775

Odd composite numbers m for which A000111(m) == (-1)^(m-1/2 ) (mod m). A180942

The "residue" pseudoprimes: odd composite numbers n such that q(n)^(n-1/2) == 1 (mod n), where base q(n) is the smallest prime quadratic residue modulo n. A307798

Starting from 1, successively take the smallest "Choix de Bruxelles" with factor 13 which is not already in the sequence. A360190

11-gonal numbers which are products of three distinct primes. A354446