Properties of the Number -1191

One Hundred Ninety-One

Basics

Value: -1192 → -1191 → -1190

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 397

Divisors: 1, 3, 397, 1191

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10010100111

Octal: -2247

Duodecimal: -833

Hexadecimal: -4a7

Square: 1418481

Square Root: 34.51086785347479

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

a(1) = 1; a(n) = -∑_k=2..n k² * a(floor(n/k)). A360390

Triangle formed by coefficients of the expansion of p(x, n), where p(x,n) = (1+x-x³)ⁿ⁺¹*∑_{j >= 0} (j+1)ⁿ*(-x + x³)^j. A156896

G.f. A(x) satisfies: [xⁿ] A(x)^n²-n+1 = 0 for n>=2. A229041

Values of n such that L(13) and N(13) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227516

Triangle read by rows: imaginary part of polylog expansion of Eulerian numbers: p(x,n) = (1 - I·x)^{n + 1}*PolyLog(-n, I·x)/x. A143197

a(n) = -a(n-2) + 2·a(n-4) - a(n-10). A89135

Expansion of x*(x³+2·x²+3·x-1)/(x+1)⁵. A119515

A triangular recursion sequence: A(n,k,m)= (m·n - m·k + 1)*A(n - 1, k - 1, m) + (m·k - (m - 1))*A(n - 1, k, m); t(n,k)=2·A(n, k, 1)*A(n + 1, k + 1, 0)/(n - k + 1) - A(n, k, 0)*A(n, k, 1). A156534

Triangle of Eulerian numbers T(n,k) (n >= 1, 1 <= k <= n) read by rows. A8292

Central polygonal numbers: a(n) = n² - n + 1. A2061