Properties of the Number -312066

Three Hundred Twelve Thousand Sixty-Six

Basics

Value: -312067 → -312066 → -312065

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 5779

Divisors: 1, 2, 3, 6, 9, 18, 27, 54, 5779, 11558

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001100001100000010

Octal: -1141402

Duodecimal: -130716

Hexadecimal: -4c302

Square: 97385188356

Square Root: 558.6286781038009

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 paths from (0,0) to (3n,0) that stay in first quadrant (but may touch horizontal axis) and where each step is (2,1), (1,2) or (1,-1). A27307

Number of n-dimensional partitions of 6. A42984

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = ∑_j=0..n binomial(n,j) * binomial(k·n+j+1,n)/(k·n+j+1). A336534

Triangle read by rows of numbers of paths in a lattice satisfying certain conditions. A71949

Length of list created by n substitutions k -> Range[-abs(k+1), abs(k-1), 2] starting with {0}. A84078

A convolution triangle of numbers based on A027307. A110682

Number of solid partitions of n with 7 parts. A389774

Number of paths from (0,0) if n is even, or from (2,1) if n is odd, to (3n,0) that stay in first quadrant (but may touch horizontal axis) and where each step is (2,1), (1,2) or (1,-1). A137842