Properties of the Number 86515

Eighty-Six Thousand Five Hundred Fifteen

Basics

Value: 86514 → 86515 → 86516

Parity: odd

Prime: No

Previous Prime: 86509

Next Prime: 86531

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 × 11 ³ × 13

Divisors: 1, 5, 11, 13, 55, 65, 121, 143, 605, 715

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101000111110011

Octal: 250763

Duodecimal: 42097

Hexadecimal: 151f3

Square: 7484845225

Square Root: 294.1343230566606

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(n) = ∑_k=0..n binomial(n,k)*binomial(2·k,k). A26375

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(k·x)*BesselI(0,2·x). A292627

Riordan array (1/sqrt(1-6x+5x²),(1-3x-sqrt(1-6x+5x²))/(2x)). A110165

Triangle interpolating the swinging factorial (A056040) restricted to even indices with its binomial transform. Same as interpolating bilateral Schroeder paths (A026375) with the central binomial coefficients (A000984). A163841

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n k^j * binomial(n,j) * binomial(2·j,j). A340970

Number of branching factorizations of the least integer of each prime signature (A025487). A366884

a(n) = T(n,[ n/2 ]), where T is the array in A026374. A26380

Riordan array (1/sqrt(1-6x+5x²),x/(1-6x+5x²)). A111965

Self-convolution of array T given by A026374. A26946

Triangle read by rows: T(n,k) (0<=k<=floor(n/2)) is the number of Delannoy paths of length n, having k ED's. A110221