Properties of the Number 22368

Twenty-Two Thousand Three Hundred Sixty-Eight

Basics

Value: 22367 → 22368 → 22369

Parity: even

Prime: No

Previous Prime: 22367

Next Prime: 22369

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 233

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 101011101100000

Octal: 53540

Duodecimal: 10B40

Hexadecimal: 5760

Square: 500327424

Square Root: 149.55935276671934

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

Rectangular table, read by antidiagonals, where the g.f. of row n, R(x,n), satisfies: R(x,n) = 1 + (n+1)*x·R(x,n+1)² for n>=0. A128570

Row 1 of table A128570. A128571

Number of Greek-key tours on a 3 X n board; i.e., self-avoiding walks on a 3 X n grid starting in the top left corner. A46994

Array read by antidiagonals: T(n,m) is the number of maximal matchings in the rook graph K_n X K_m. A341847

Triangle T, read by rows, where column k of T = column 0 of T^k+1 for k>0, with column 0 of T = column 0 of T⁴ shift right. A138271

Column 2 of triangle A138271; also, column 0 of matrix power A138271³. A138274

Number of maximal matchings in the n X n rook graph. A289198

G.f.: exp( ∑_n>=1 A322201(n)*xⁿ/n ), where A322201(n) is the coefficient of xⁿ*yⁿ/(2·n) in ∑_n>=1 -log(1 - (xⁿ + yⁿ)). A322202

Triangle of coefficients of polynomials v(n,x) jointly generated with A208759; see the Formula section. A208760

a(n) = ∑_k=1..n k·rad(k). A350996