Properties of the Number -199094

One Hundred Ninety-Nine Thousand Ninety-Four

Basics

Value: -199095 → -199094 → -199093

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 14221

Divisors: 1, 2, 7, 14, 14221, 28442, 99547, 199094

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110000100110110110

Octal: -604666

Duodecimal: -97272

Hexadecimal: -309b6

Square: 39638420836

Square Root: 446.19950694728476

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

Square array of coefficients in the successive iterations of x·C(x) = (1-sqrt(1-4·x))/2 where C(x) is the g.f. of the Catalan numbers (A000108); read by antidiagonals. A158825

a(n) = floor( γ(n + 4/5)/γ(4/5) ). A20082

Third iteration of x·C(x) where C(x) is the Catalan function (A000108). A158826

G.f.: A(x) = 1 + x·A(x)*A(-x) + x²*exp( ∑_n>=1 2·L(n)²*x^2·n/n ), where A(x) = exp(∑_n>=1 L(n)*xⁿ/n). A205566

a(n) = K₄(n) = ∑_k>=0 A090285(4,k)*2^k*binomial(n,k). a(n) = 2*(n⁴+14·n³+62·n²+91·n+21)/3. A90296

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 1, 1), (1, 0, 1), (1, 1, -1)}. A150589