Properties of the Number -8659

Six Hundred Fifty-Nine

Basics

Value: -8660 → -8659 → -8658

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 7 × 1237

Divisors: 1, 7, 1237, 8659

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10000111010011

Octal: -20723

Duodecimal: -5017

Hexadecimal: -21d3

Square: 74978281

Square Root: 93.05374790947434

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

a(0)=1, a(n) = n*(a(n-1) - 1) for n>0. A166554

a(n) = n! * ∑_k=1..n-1 1/k!. A38156

Number of distinct resistances that can be produced using at most n equal resistors in series and/or parallel, confined to the five arms (four arms and the diagonal) of a bridge configuration. Since the bridge requires a minimum of five resistors, the first four terms are zero. A174286

Number of unordered rooted trees where each subtree from given node has the same number of nodes. A127524

Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base. A60879

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having nonzero determinant and having the same number of clockwise edge increases as its horizontal and vertical neighbors. A205768

Centered 13-gonal numbers. A69126

Number of partitions of n with rank a multiple of 3. A328988

Triangle read by rows: T(n,k) is the number of weighted lattice paths B(n) having a total of k uhd and uHd strings. A247294

Triangle read by rows: T(i,j) for the recurrence T(i,j) = (T(i-1,j) + 1)*i. A121662