Properties of the Number 27836

Twenty-Seven Thousand Eight Hundred Thirty-Six

Basics

Value: 27835 → 27836 → 27837

Parity: even

Prime: No

Previous Prime: 27827

Next Prime: 27847

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 6959

Divisors: 1, 2, 4, 6959, 13918, 27836

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110010111100

Octal: 66274

Duodecimal: 14138

Hexadecimal: 6cbc

Square: 774842896

Square Root: 166.84124190379308

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 (n+1)X(k+1) 0..2 arrays colored with the sum of the upper and lower median values of each 2X2 subblock. A236354

Augmentation of the Euler partition triangle A026820. See Comments. A193591

Number of (n+1)X(2+1) 0..2 arrays colored with the sum of the upper and lower median values of each 2X2 subblock. A236350

Number of (n+1)X(3+1) 0..2 arrays colored with the sum of the upper and lower median values of each 2X2 subblock. A236351

Index of the smallest triangular number greater than 3ⁿ. A266498

Plane partitions into odd parts. A242362

Total number of vertices in all loopless rooted planar maps with n edges. A27836

Number of 9-step self-avoiding walks on an n X n X n cube summed over all starting positions. A187170

a(1)=1; for n>1, define a sequence {b(m), m >= 1} by b(1)=n b(2)=13, and b(m) = A020639(b(m-2)) + A006530(b(m-1)); then a(n) is the number of terms in that sequence before the first of the infinite string of 4s. A271720

G.f. A(x) satisfies: A(x)² = ∑_n>=0 xⁿ*A(x)^2ⁿ. A192315