Properties of the Number 26836

Twenty-Six Thousand Eight Hundred Thirty-Six

Basics

Value: 26835 → 26836 → 26837

Parity: even

Prime: No

Previous Prime: 26833

Next Prime: 26839

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 6709

Divisors: 1, 2, 4, 6709, 13418, 26836

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110100011010100

Octal: 64324

Duodecimal: 13644

Hexadecimal: 68d4

Square: 720170896

Square Root: 163.8169710378018

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

The records for distance squared for step lengths between adjacent primes in A330979, the visited primes for a walk stepping to the closest unvisited prime on the Ulam Spiral. A331027

T(n,k)=Number of n-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on a kXk board summed over all starting positions. A187857

a(n) = 0 if n <= 2; thereafter a(n) = A238827(n) + A238830(n-2). A238831

Number of n-node rooted identity trees of height 10. A229404

Irregular triangle read by rows: T(n,k) = number of ways k brooks (0 <= k <= 2n+1) can be placed on the grid points of an n triboard so that no two brooks lie in the same straight line. A260333

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 98 ones. A31866

Number of 5-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions. A187860

Number of line segments connecting exactly 8 points in an n·n grid of points. A177724

Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts, the greatest being k, for k=1,2,...,n. A26836