Properties of the Number -191360

One Hundred Ninety-One Thousand Three Hundred Sixty

Basics

Value: -191361 → -191360 → -191359

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁷ × 5 × 13 × 23

Divisors: 1, 2, 4, 5, 8, 10, 13, 16, 20, 23

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -101110101110000000

Octal: -565600

Duodecimal: -928A8

Hexadecimal: -2eb80

Square: 36618649600

Square Root: 437.4471396637541

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) = E(n, k)*2^k where E(n,k) are the Eulerian numbers A173018, for n > 0 and 0 <= k <= n-1, additionally T(0,0) = 1. A156365

G.f.: A(x) = exp( ∑_n>=1 A163659(n)²*xⁿ/n ), where x·exp(∑_n>=1 A163659(n)*xⁿ/n) = S(x) is the g.f. of Stern's diatomic series (A002487). A163658

Triangle T(n, k) = 2^k-1 * E(n, k-1) where E(n,k) are the Eulerian numbers A173018, read by rows. A142075

A symmetrical triangle: T(n,k) = A008292(n+1, k) * f(n,k), where f(n,k) = 2^k when floor(n/2) >= k, otherwise 2^n-k. A174303

Number of (n+2)X(n+2) symmetric binary matrices without the pattern 1 1 1 diagonally or antidiagonally. A190420

a(1) = 1; a(n) = ∑_{k=1..n-1, gcd(n,k) = 1} binomial(n,k)*a(k). A308475