Properties of the Number -7617

Six Hundred Seventeen

Basics

Value: -7618 → -7617 → -7616

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 2539

Divisors: 1, 3, 2539, 7617

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1110111000001

Octal: -16701

Duodecimal: -44A9

Hexadecimal: -1dc1

Square: 58018689

Square Root: 87.27542609463445

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

Logarithmic derivative of the g.f. of the solid partitions A000293. A277613

Hexanacci numbers: a(n+1) = a(n)+...+a(n-5) with a(0)=...=a(4)=0, a(5)=1. A1592

Triangle read by rows: T(n,k) is the number of permutations of 2 indistinguishable copies of 1..n with exactly k local maxima. A334774

Array read by antidiagonals: T(n,k) is the number of permutations of k indistinguishable copies of 1..n with exactly 2 local maxima. A334773

House numbers: a(n) = (n+1)³ + ∑_i=1..n i². A51662

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with 2X2 subblock sums lexicographically nondecreasing rowwise and nonincreasing columnwise. A235413

a(n) = ∑_{k=1..floor((n+1)/2)} T(n,2k-1), array T as in A049777. A49778

Number of partitions of n such that (number parts having multiplicity 1) is not a part and (number of parts > 1) is not a part. A241514

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and vertical height (i.e., number of rows) k (1 <= k <= n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121692

a(n) = Least i in range [A165583(n),A165583(n+1)] for which abs(A165582(i)) gets the maximum value in that range. A165584