Properties of the Number 26851

Twenty-Six Thousand Eight Hundred Fifty-One

Basics

Value: 26850 → 26851 → 26852

Parity: odd

Prime: No

Previous Prime: 26849

Next Prime: 26861

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 2441

Divisors: 1, 11, 2441, 26851

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100011100011

Octal: 64343

Duodecimal: 13657

Hexadecimal: 68e3

Square: 720976201

Square Root: 163.86274744431694

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

Partial sums of A294016. A294017

Odd composites (including 1 in the count) where the number 3 mod 4 equals the number 1 mod 4. A93181

Semiprimes (A001358) whose digit reversal is a pentagonal number (A000326). A115708

Expansion of (1/x) * Series_Reversion( x * (1-x+x³)³ ). A368972

Number of length n 1..(1+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11. A254940

a(n) = T(2n,n+2), T given by A026736. A26851

Number of (n+1)X3 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A203735

Number of (n+1)X(2+1) 0..3 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250701