Properties of the Number 5656

Five Thousand Six Hundred Fifty-Six

Basics

Value: 5655 → 5656 → 5657

Parity: even

Prime: No

Previous Prime: 5653

Next Prime: 5657

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 7 × 101

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 101, 202

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011000011000

Octal: 13030

Duodecimal: 3334

Hexadecimal: 1618

Square: 31990336

Square Root: 75.20638270785267

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 integer compositions of n whose leaders of strictly increasing runs are identical. A374686

Numbers which have only digits 5 and 6 in base 10. A256291

a(n) = A₅(n) where A_m(x) are the Eulerian polynomials as defined in A326323. A326324

Expansion of (1-x-x^N)/((1-x)(1-x²)(1-x³)...(1-x^N)) for N = 6. A60025

Centered 13-gonal numbers. A69126

a(n) = ∑_k=0..n A(n,k)*n^k where A(n,k) are Eulerian numbers. A122778

Number of partitions p of n into distinct parts such that max(p) > 2·min(p). A241037

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

A(n, k) = A_n(k) where A_n(x) are the Eulerian polynomials, square array read by ascending antidiagonals, for n >= 0 and k >= 0. A326323

Number of conjugacy classes of primitive elements in GF(11ⁿ) which have trace 0. A192510