Properties of the Number -6810

Eight Hundred Ten

Basics

Value: -6811 → -6810 → -6809

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 227

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 227, 454

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101010011010

Octal: -15232

Duodecimal: -3B36

Hexadecimal: -1a9a

Square: 46376100

Square Root: 82.52272414311103

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

Coefficient array of orthogonal polynomials P(n,x)=(x-n)*P(n-1,x)-(n-1)²*P(n-2,x), P(0,x)=1, P(1,x)=x-1. A182823

Number of integer partitions of n having a part that can be written as a nonnegative linear combination of the other (possibly equal) parts. A364913

Variation of Boustrophedon transform applied to sequence 1,0,0,0,...: fill an array by diagonals in alternating directions - 'up' and 'down'. The first element of each diagonal after the first is 0. When 'going up', add to the previous element the elements of the row the new element is in. When 'going down', add to the previous element the elements of the column the new element is in. The final element of the n-th diagonal is a(n). A59219

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

Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly four solutions. A230856

Triangle T(n,k) of number of loopless multigraphs with n labeled edges and k labeled vertices and without isolated vertices, n >= 1; 2 <= k <= 2·n. A122193

Expansion of (-1 + ∏_k>=1 (1 + x^k)^k)². A341384

The array in A059219 read by antidiagonals in 'up' direction. A59220

Triangle T(n,k), 0<=k<=n, formed from coefficients when formula for n-th diagonal of triangle in A059718 is written as a sum of binomial coefficients. A59720

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0ⁿ and T(n,k) = k * ∑_r=0..n binomial(n,r) * binomial(3·n+r+k,n)/(3·n+r+k) for k > 0. A378238