Properties of the Number 36656

Thirty-Six Thousand Six Hundred Fifty-Six

Basics

Value: 36655 → 36656 → 36657

Parity: even

Prime: No

Previous Prime: 36653

Next Prime: 36671

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ⁴ × 29 × 79

Divisors: 1, 2, 4, 8, 16, 29, 58, 79, 116, 158

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111100110000

Octal: 107460

Duodecimal: 19268

Hexadecimal: 8f30

Square: 1343662336

Square Root: 191.45756710038913

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

Molien series for group G_1,2⁸ of order 1536. A51462

G.f.: ∑_n>=0 xⁿ / (1-x)^n⁵. A227935

Number of length n+3 0..3 arrays with at most one downstep in every n consecutive neighbor pairs. A258733

Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite VNI = VPI-9 Rb44K4[Zn24Si96O240].48H2O starting with a T4 atom. A19257

Number of permutations of 1..n v[1..n] with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171339

Consider the base-5 Kaprekar map n->K(n) defined in A165032. Sequence gives numbers belonging to cycles of length greater than 1. A165039

T(n,k)=Number of length n+k 0..3 arrays with at most one downstep in every k consecutive neighbor pairs. A258730

Length of cycle mentioned in A165039. A165040

Number of n-node rooted unlabeled trees with outdegree <= 2 and exactly 1 edge at the root. A36656

G.f. satisfies: A(x) = 1 + x*∑_n>=0 (A(x)³ - 1)ⁿ. A192946