Properties of the Number -316008

Three Hundred Sixteen Thousand Eight

Basics

Value: -316009 → -316008 → -316007

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ³ × 7 × 11 × 19

Divisors: 1, 2, 3, 4, 6, 7, 8, 9, 11, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001101001001101000

Octal: -1151150

Duodecimal: -132A60

Hexadecimal: -4d268

Square: 99861056064

Square Root: 562.1458885378421

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 e.g.f. (1 + x)^x. A7113

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 + x)^{x^k}. A355607

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 + x)^{x^k/k!}. A355619

Stanley's children's game. Class of n (named) children forms into rings with exactly one child inside each ring. We allow the case when outer ring has only one child. a(n) gives number of possibilities, including clockwise order (or which hand is held), in each ring. A66166

Number of permutations of order n avoiding the consecutive pattern 11'22'. A177470

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 - x)^{-x^k/k!}. A355610

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. (1 - x)^{-x^k}. A355609

Numbers with prime factorization pqrs^3t^3. A190385

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)ⁿ * n! * ∑_{j=0..floor(n/2)} k^j * Stirling1(n-j,j)/(n-j)!. A362834

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)ⁿ * n! * ∑_{j=0..floor(n/2)} k^n-j * Stirling1(n-j,j)/(n-j)!. A362837