Properties of the Number -7291

Two Hundred Ninety-One

Basics

Value: -7292 → -7291 → -7290

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 23 × 317

Divisors: 1, 23, 317, 7291

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1110001111011

Octal: -16173

Duodecimal: -4277

Hexadecimal: -1c7b

Square: 53158681

Square Root: 85.38735269347563

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

Triangle of coefficients of numerators of powers of e² in ∑_k>=1 {1 / (1 + (k+1/2)²*π²)ⁿ} + {4ⁿ / (4+π²)ⁿ}. A85471

Number of inseparable partitions of n; see Comments. A325535

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

Dispersion of A047209, (numbers >1 and congruent to 1 or 4 mod 5), by antidiagonals. A191728

T(n,k) = number of n X k arrays with rows being permutations of 0..k-1 and no column j greater than column j-1 in all rows (n, k >= 1). A212855

Number of n X 3 arrays with rows being permutations of 0..2 and no column j greater than column j-1 in all rows. A212850

Partial sums of binomial(3n,n)². A188679

Sums of distinct powers of 9. A33046

Number of 5 X n arrays with rows being permutations of 0..n-1 and no column j greater than column j-1 in all rows. A212858

Numbers k such that k⁸ == 1 (mod 9³). A56084