Properties of the Number 5296

Five Thousand Two Hundred Ninety-Six

Basics

Value: 5295 → 5296 → 5297

Parity: even

Prime: No

Previous Prime: 5281

Next Prime: 5297

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 331

Divisors: 1, 2, 4, 8, 16, 331, 662, 1324, 2648, 5296

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010010110000

Octal: 12260

Duodecimal: 3094

Hexadecimal: 14b0

Square: 28047616

Square Root: 72.77362159464101

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

Coordination sequence for "ubt" 3D uniform tiling. A299291

Expansion of e.g.f.: exp(2·x)/(1-x). A10842

Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1. A8282

a(n) = ∑_k=0..n-1 Bell(k), where the Bell numbers Bell(k) are given in A000110. A5001

Triangle of Euler-Bernoulli or Entringer numbers read by rows. A8281

Boustrophedon version of triangle of Euler-Bernoulli or Entringer numbers read by rows. A8280

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. A302069

G.f.: ∑_n>=0 xⁿ / (1-x)^2·n+1 * [∑_k=0..n C(n,k)² * x^k] * [∑_k=0..n C(n,k)² * 2^k * x^k]. A243948

Triangle of Euler-Bernoulli or Entringer numbers. A10094

Number of open knight's tour diagrams of a 3 X n chessboard that have "type X": both endpoints occur in the same column. A169770