Number of the day: 8659

Properties of the number 8659:

8659 is a cyclic number.
8659 = 7 × 1237 is semiprime and squarefree.
8659 has 2 distinct prime factors, 4 divisors, 9 antidivisors and 7416 totatives.
8659 has a triangular digit sum 28 in base 10.
8659 = 4330² - 4329² = 622² - 615² is the difference of 2 nonnegative squares in 2 ways.
8659 is the difference of 2 positive pentagonal numbers in 2 ways.
8659 = 1² + 3² + 93² is the sum of 3 positive squares.
8659² = 4284² + 7525² is the sum of 2 positive squares in 1 way.
8659² is the sum of 3 positive squares.
8659 is a proper divisor of 937⁶ - 1.
8659 = '865' + '9' is the concatenation of 2 semiprime numbers.
8659 is an emirpimes in (at least) the following bases: 7, 13, 14, 16, 18, 21, 23, 26, 27, 34, 37, 47, 53, 59, 65, 68, 69, 70, 71, 72, 75, 77, 79, 80, 82, 83, 86, 87, 89, 90, 91, 92, 94, 97, and 98.
8659 is palindromic in (at least) the following bases: 3, 74, and 78.
8659 in base 46 = 44B and consists of only the digits '4' and 'B'.

The number 8659 belongs to the following On-Line Encyclopedia of Integer Sequences (OEIS) sequences (among others):

Sequence numbers and descriptions below are taken from OEIS.
A038156: a(n) = n! * Sum_{k=1..n-1} 1/k!.
A060879: Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
A069126: Centered 13-gonal numbers.
A082459: Multiply by 1, add 1, multiply by 2, add 2, etc.
A121662: Triangle read by rows: T(i,j) for the recurrence T(i,j)=(T(i-1)+1,j)*i.
A127524: Number of unordered rooted trees where each subtree from given node has the same number of nodes.
A174286: 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.
A205768: 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
A247294: 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.
A247295: Number of weighted lattice paths B(n) having no uhd and no uHd strings.