Properties of the Number -165760

One Hundred Sixty-Five Thousand Seven Hundred Sixty

Basics

Value: -165761 → -165760 → -165759

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁷ × 5 × 7 × 37

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 16, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -101000011110000000

Octal: -503600

Duodecimal: -7BB14

Hexadecimal: -28780

Square: 27476377600

Square Root: 407.13634079998315

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

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) is the constant term in the expansion of ((∑_j=-n..n x^j) * (∑_j=-n..n y^j) - (∑_j=-n+1..n-1 x^j) * (∑_j=-n+1..n-1 y^j))^k. A329074

Constant term in the expansion of ((∑_k=-2..2 x^k) * (∑_k=-2..2 y^k) - (∑_k=-1..1 x^k) * (∑_k=-1..1 y^k))ⁿ. A329075

Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows: Number T(n,k) of forests of labeled rooted trees on n or fewer nodes using a subset of labels 1..n and k edges. A144289

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) is the number of k-step closed paths (from origin to origin) in 2-dimensional lattice, using steps (t₁,t₂) (|t₁| + |t₂| = n). A329078

Irregular triangle read by rows where T(n,k) is the number of independent sets of size k in the n-folded cube graph. A355227