Properties of the Number 9813

Nine Thousand Eight Hundred Thirteen

Basics

Value: 9812 → 9813 → 9814

Parity: odd

Prime: No

Previous Prime: 9811

Next Prime: 9817

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 3271

Divisors: 1, 3, 3271, 9813

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011001010101

Octal: 23125

Duodecimal: 5819

Hexadecimal: 2655

Square: 96294969

Square Root: 99.06058752097123

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

Number of simple non-isomorphic n-vertex graphs of connectivity 7. A324088

Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1). A259862

a(n) = 2ⁿ * ∑_k=0..n k^p*q^k, where p=2, q=-1/2. A232603

Sum of the squarefree parts of the partitions of n into 4 parts. A309479

n³+Largest square, (Largest square <= n³). A176580

Sums of 7 distinct powers of 3. A38469

Place n equally spaced points on each side of an equilateral triangle, and join each of these points by a chord to the 2·n new points on the other two sides: sequence gives number of interior vertices in the resulting planar graph. A366484

a(n) + a(n+1) + a(n+2) = n⁵, with a(1) = a(2) = 0. A152730

Partial sums of A252750: a(0) = 0; for >= 1: a(n) = A252750(n) + a(n-1). A252751

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n·k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of internal vertices in the resulting planar graph. A367303