Properties of the Number 52856

Fifty-Two Thousand Eight Hundred Fifty-Six

Basics

Value: 52855 → 52856 → 52857

Parity: even

Prime: No

Previous Prime: 52837

Next Prime: 52859

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 6607

Divisors: 1, 2, 4, 8, 6607, 13214, 26428, 52856

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100111001111000

Octal: 147170

Duodecimal: 26708

Hexadecimal: ce78

Square: 2793756736

Square Root: 229.90432792794485

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 ways to place 6 nonattacking queens on a 6 X n board. A61992

Number of ways to place m nonattacking queens on an m X n board, 1 <= m <= n (triangular array). A269133

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) <= number of parts of p. A241829

Let π be an unrestricted partition of n with the summands written in binary notation. a(n) is the number of such partitions whose binary representation has an odd number of binary ones. A102437

Expansion of e.g.f.: exp(x) / (1 - 6·x)^1/6. A347014

E.g.f.: (1-3·exp(x)+exp(2·x))/(exp(x)-2). A52856

The profiles of the backtrack tree for the n queens problem, triangle read by rows. A319284