Properties of the Number 10813

Ten Thousand Eight Hundred Thirteen

Basics

Value: 10812 → 10813 → 10814

Parity: odd

Prime: No

Previous Prime: 10799

Next Prime: 10831

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 11 × 983

Divisors: 1, 11, 983, 10813

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10101000111101

Octal: 25075

Duodecimal: 6311

Hexadecimal: 2a3d

Square: 116920969

Square Root: 103.98557592281729

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

Expansion of (1-2x²)/(1-x-3x²+2x⁴). A52962

Column of Motzkin triangle. A5322

Number of squares on infinite chessboard at <= n knight's moves from a fixed square. A18836

a(1)=1. a(n) = a(n-1) + sum of the squares which are among the first (n-1) terms of the sequence. A101135

a(n) = C(n,5) + C(n,4) - C(n,3) + 1, n >= 7. A5288

a(n) = (1 + ∑_j=1..K-1 a(n-j) + a(n-1)*a(n-K+1))/a(n-K) with a(1),...,a(K)=1, where K=4. A283329

a(n) = (d(n) - r(n))/5, where d = A026037 and r is the periodic sequence with fundamental period (1,2,0,2,0). A26039

Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k returns to the x-axis from above (i.e., d steps hitting the x-axis). A109195

Number of lines through at least 2 points of a 5 X n grid of points. A160845

The number of distinct positions on an infinite chessboard reachable by the (3,4)-leaper in <= n moves. A297741