Properties of the Number 26831

Twenty-Six Thousand Eight Hundred Thirty-One

Basics

Value: 26830 → 26831 → 26832

Parity: odd

Prime: No

Previous Prime: 26821

Next Prime: 26833

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 3833

Divisors: 1, 7, 3833, 26831

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100011001111

Octal: 64317

Duodecimal: 1363B

Hexadecimal: 68cf

Square: 719902561

Square Root: 163.80170939278992

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 with every 2X2 subblock diagonal minus antidiagonal sum nondecreasing horizontally and vertically. A253456

Triangle T(n,k) read by rows: number of k X k triangular (0,1)-matrices with exactly n entries equal to 1 and no zero rows or columns. A137252

Numbers k such that A003415(k) == A276085(k) (mod 5⁵), where A003415 is the arithmetic derivative and A276085 is the primorial base log-function. A391865

a(i) is a square mod a(j), i <> j. A34903

Number of (n+1) X (4+1) 0..2 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally and vertically. A253452

Number of (n+1) X (5+1) 0..2 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally and vertically. A253453

Partial sums of A299037. A299767

Number of partitions of n into distinct parts, the least being 10. A26831