Properties of the Number -1057221

Fifty-Seven Thousand Two Hundred Twenty-One

Basics

Value: -1057222 → -1057221 → -1057220

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 11 × 59 × 181

Divisors: 1, 3, 9, 11, 33, 59, 99, 177, 181, 531

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -100000010000111000101

Octal: -4020705

Duodecimal: -42B999

Hexadecimal: -1021c5

Square: 1117716242841

Square Root: 1028.2125266694625

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 central factorial numbers |4^k t(2n+1,2n+1-2k)| read by rows (n>=0, k=0..n). A8956

Exponential Riordan array (1, arcsin(x)). A385343

Central factorial numbers: 1st subdiagonal of A008956. A1824

Triangle T(n,k) defined by the generating function: exp(y·arcsin(x))-1 = ∑_n>=1 (∑_k=1..n T(n,k)*y^k)*xⁿ/n!. A121408

Triangle read by rows: coefficients in expansion of Q(n) = (x-n²)*(x-(n-2)²)*(x-(n-4)²)*...*(x-(1 or 2)²), highest powers first. A182971

Triangle T(n,k) defined by the generating function cosh(sqrt(y)*arcsin(x)) + sqrt(y)*sinh(sqrt(y)*arcsin(x)) - 1 = ∑_n>=1 ∑_k=1..n T(n,k)*y^k *xⁿ/n!. A91885

Square array T(n,k), n>=0, k>=0, read by antidiagonals: T(n,k) = ((2n-1)!!)^k * ∑_i=1..n 1/(2·i-1)^k. A291656

Table of the number of (n,k)-Riordan complexes, read by rows. A160563