Properties of the Number -191251

One Hundred Ninety-One Thousand Two Hundred Fifty-One

Basics

Value: -191252 → -191251 → -191250

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 191251

Divisors: 1, 191251

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -101110101100010011

Octal: -565423

Duodecimal: -92817

Hexadecimal: -2eb13

Square: 36576945001

Square Root: 437.32253543580396

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

This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,4). The p-th row (p>=1) contains a(i,p) for i=1 to 4·p-3, where a(i,p) satisfies ∑_i=1..n C(i+3,4)^p = 5·C(n+4,5) * ∑_i=1..4·p-3 a(i,p) * C(n-1,i-1)/(i+4). A87108

Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 5. A244706

Primes that remain prime through 5 iterations of function f(x) = 2x + 9. A23334

∑_{k = 0..n} C(n, k)²*C(n+k, n)*C(n+2·k, n). A98274