Properties of the Number 22592

Twenty-Two Thousand Five Hundred Ninety-Two

Basics

Value: 22591 → 22592 → 22593

Parity: even

Prime: No

Previous Prime: 22573

Next Prime: 22613

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁶ × 353

Divisors: 1, 2, 4, 8, 16, 32, 64, 353, 706, 1412

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100001000000

Octal: 54100

Duodecimal: 110A8

Hexadecimal: 5840

Square: 510398464

Square Root: 150.30635382444748

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

Number of multiset partitions of integer partitions of n such that all blocks have odd size. A356932

T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4. A240000

T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 59 (59 maximizes T(1,1)). A233859

Denominator of fraction equal to the continued fraction [ 3, 1, 4, 1, 5... ] (first n digits of π). A36254

Triangle read by rows: T(n,k) = number of arrangements of k non-attacking bishops on the white squares of an n X n board with every square controlled by at least one bishop (1<=k<n). A288182

Triangle read by rows: T(n,k) = number of arrangements of k non-attacking bishops on the black squares of an n X n board with every square controlled by at least one bishop. A288183

G.f. C(x) satisfies: ∑_n>=0 (-1)ⁿ * n * ( C(C(x)) - (-1)ⁿ*C(C(-x)) )ⁿ = 0. A318642

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0ⁿ and T(n,k) = k * ∑_r=0..n binomial(n,r) * binomial(n+2·r+k,n)/(n+2·r+k) for k > 0. A378236

Expansion of ∏_k>=1 (1 - k·x^k)/(1 + 2·x^k). A269155

Discriminants of totally complex sextic fields (negated). A23687