Properties of the Number 26819

Twenty-Six Thousand Eight Hundred Nineteen

Basics

Value: 26818 → 26819 → 26820

Parity: odd

Prime: No

Previous Prime: 26813

Next Prime: 26821

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 13 × 2063

Divisors: 1, 13, 2063, 26819

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100011000011

Octal: 64303

Duodecimal: 1362B

Hexadecimal: 68c3

Square: 719258761

Square Root: 163.76507564190845

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..1 arrays x(i,j) with row sums sum{x(i,j), j=1..k+1} nondecreasing, and column sums sum{i·x(i,j), i=1..n+1} nondecreasing. A233062

Draw a regular n-gon and the enclosing circle, then for each pair of vertices X, Y, draw a circle with diameter XY; the union of these figures is the graph H_n; sequence gives number of regions in H_n. A370978

Number of (n+1)X(3+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..3+1} nondecreasing, and column sums sum{i·x(i,j), i=1..n+1} nondecreasing. A233060

Number of (5+1)X(n+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i·x(i,j), i=1..5+1} nondecreasing. A233066

a(n) = least k such that if 1<=h<=n then T(n,k)>=T(n,h), T given by A008284. A26819