Properties of the Number 56232

Fifty-Six Thousand Two Hundred Thirty-Two

Basics

Value: 56231 → 56232 → 56233

Parity: even

Prime: No

Previous Prime: 56209

Next Prime: 56237

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 11 × 71

Divisors: 1, 2, 3, 4, 6, 8, 9, 11, 12, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101101110101000

Octal: 155650

Duodecimal: 28660

Hexadecimal: dba8

Square: 3162037824

Square Root: 237.13287414443406

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250632

Expansion of e.g.f. log(1+x) * sinh(x). A177699

Number of 4-cycles in the n-polygon diagonal intersection graph. A300552

Number of distinct cycles without repeated edges on the multigraph with 2 vertices connected by n edges. A263102

Number of (n+1)X(4+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250628

Number of (3+1)X(n+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250635

Number of length 2+2 0..n arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero. A252178

a(n) = n!*∑_{m=1..floor(n/2)} 1/(m²*binomial(n-m,m)). A358651

Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 2. A56232

Number of nX7 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 1 vertically. A207513