Properties of the Number 26812

Twenty-Six Thousand Eight Hundred Twelve

Basics

Value: 26811 → 26812 → 26813

Parity: even

Prime: No

Previous Prime: 26801

Next Prime: 26813

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 6703

Divisors: 1, 2, 4, 6703, 13406, 26812

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100010111100

Octal: 64274

Duodecimal: 13624

Hexadecimal: 68bc

Square: 718883344

Square Root: 163.74370216896892

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)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 nXk array. A220922

T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, diagonal and antidiagonal neighbors in a random 0..3 nXk array. A220993

T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and vertical neighbors in a random 0..2 nXk array. A220259

Majority value maps: number of n X 2 binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and vertical neighbors in a random 0..2 n X 2 array. A220255

T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and vertical neighbors in a random 0..3 nXk array. A220323

Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two neighbors equal. A199706

a(n) is the smallest k such that A000005(j) = A000005(j-m) for j = k..k+n-1 for some m > 0. A364189

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 1, 1), (0, -1, 1), (1, 1, 0)}. A149189

Number of partitions of n in which the greatest part is 6. A26812

Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and column sum equal to 2 3 4 6 or 7 and every 3 X 3 diagonal and antidiagonal sum not equal to 2 3 4 6 or 7. A252162