Properties of the Number 56219

Fifty-Six Thousand Two Hundred Nineteen

Basics

Value: 56218 → 56219 → 56220

Parity: odd

Prime: No

Previous Prime: 56209

Next Prime: 56237

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 17 × 3307

Divisors: 1, 17, 3307, 56219

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101101110011011

Octal: 155633

Duodecimal: 2864B

Hexadecimal: db9b

Square: 3160575961

Square Root: 237.10546176754343

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) is the number of (n+1) X (k+1) 0..2 arrays with column and row pair sums b(i,j) = a(i,j) + a(i,j-1) and c(i,j) = a(i,j) + a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing. A203965

Number of (n+1) X 2 0..2 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing. A203958

Number of (n+1)X8 0..2 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing. A203964

Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i. A56219