Properties of the Number -316800

Three Hundred Sixteen Thousand Eight Hundred

Basics

Value: -316801 → -316800 → -316799

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁷ × 3 ² × 5 ² × 11

Divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, 11

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -1001101010110000000

Octal: -1152600

Duodecimal: -133400

Hexadecimal: -4d580

Square: 100362240000

Square Root: 562.8498911788115

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 nXk 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, diagonally or antidiagonally. A232920

Subsets of {1,2,...,n-6} without differences equal to 3 or 6. A224810

Triangle read by rows: T(n,k) is the number of polygons with 2·n sides, of which k run through the center of a circle, on the circumference of which the 2·n vertices of the polygon are arranged at equal spacing. A330662

a(n) = n(n+1)(n+2)...(n+8) / (n+(n+1)+(n+2)+...+(n+8)). A32780

Number of n X n 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, diagonally or antidiagonally. A232916

Number of n X 5 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, diagonally or antidiagonally. A232917

Number of 5Xn 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, diagonally or antidiagonally. A232924