Properties of the Number 51568

Fifty-One Thousand Five Hundred Sixty-Eight

Basics

Value: 51567 → 51568 → 51569

Parity: even

Prime: No

Previous Prime: 51563

Next Prime: 51577

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 11 × 293

Divisors: 1, 2, 4, 8, 11, 16, 22, 44, 88, 176

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100100101110000

Octal: 144560

Duodecimal: 25A14

Hexadecimal: c970

Square: 2659258624

Square Root: 227.08588683579612

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 nXk 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279268

Number of 6-step left-handed knight's tours (moves only out two, left one) on an n X n board summed over all starting positions. A187176

Number of length 3+4 0..n arrays with every five consecutive terms having four times some element equal to the sum of the remaining four. A249659

Number of nX5 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279265

Number of nX6 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279266

Trajectory of 3 under map n->13n+1 if n odd, n->n/2 if n even. A37104

The number of unlabeled trees T on n vertices for which maximum multiplicity attained by any matrix whose graph is T implies the simplicity of its other eigenvalues. A347018

T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having four times some element equal to the sum of the remaining four. A249656

Let M(n) (A051755) be the maximal number of queens that can be placed on an n X n chessboard so that each queen attacks exactly two other queens; a(n) is the number of non-equivalent solutions. "Non-equivalent" means none of the a(n) solutions can be mapped onto any other solution by board rotations through 90, 180 or 270 degrees or mirror operations along the two diagonals or center lines. A51568

Where records occur in A321223. A323034