Properties of the Number 21592

Twenty-One Thousand Five Hundred Ninety-Two

Basics

Value: 21591 → 21592 → 21593

Parity: even

Prime: No

Previous Prime: 21589

Next Prime: 21599

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 2699

Divisors: 1, 2, 4, 8, 2699, 5398, 10796, 21592

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 101010001011000

Octal: 52130

Duodecimal: 105B4

Hexadecimal: 5458

Square: 466214464

Square Root: 146.94216549377512

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

G.f.: ∑_k>=1 x^2·k/(1+x^2·k) * ∏_k>=1 (1+x^k)/(1-x^k). A305122

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 185", based on the 5-celled von Neumann neighborhood. A279700

Half the difference between the larger and smaller term of the n-th amicable pair. A162884

Half the difference between the larger and smaller terms of the n-th amicable pair (x,y) given in A259933. A275470

Expansion of (G(-x) / χ(-x))² in powers of·where χ() is a Ramanujan θ function and G() is a Rogers-Ramanujan function. A261866

Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes or outdegrees larger than six. A292212

Sums of antidiagonals of A321964. A321961

G.f. A(x) = ∏_n>=1 P(n,x), where P(1,x) = 1/sqrt(1 - 4·x), and P(n+1,x) = 1/sqrt(1 - 4·x + 4·x*P(n,x)) for n >= 1. A351512

Indices of primes in sequence defined by A(0) = 89, A(n) = 10·A(n-1) - 21 for n > 0. A101075

G.f.: ∏_n>=0 1/(1-a(n)*xⁿ⁺¹)³ = ∑_n>=0 a(n)*xⁿ. A203507