Properties of the Number 13087

Thirteen Thousand Eighty-Seven

Basics

Value: 13086 → 13087 → 13088

Parity: odd

Prime: No

Previous Prime: 13063

Next Prime: 13093

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 23 × 569

Divisors: 1, 23, 569, 13087

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001100011111

Octal: 31437

Duodecimal: 76A7

Hexadecimal: 331f

Square: 171269569

Square Root: 114.39842656260619

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

Triangle read by rows: row n is the first row of the matrix M[n]^n-1, where M[n] is the n X n tridiagonal matrix with main diagonal (1,4,4,...) and super- and subdiagonals (1,1,1,...). A124576

a(n) = G_n(5), where G_n(k) is the Goodstein function defined in A266201. A266204

T(n,k)=Number of length n+5 0..k arrays with every six consecutive terms having five times some element equal to the sum of the remaining five. A249497

Number of ordered triples (w,x,y) with all terms in {1,...,n} and w²<x²+y². A211635

Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553. A63061

a(0)=1. a(n) = a(n-1) + (largest integer occurring among {a(0),a(1),a(2),...,a(n-1)} that is coprime to n). A120938

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 2-cell columns (n>=1; 0<=k<=n-1). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121637

Total number of binary digits in the partitions of n into odd parts. A319142

Number of complex base i-1 points which can be represented within n bits and negated within those n bits. A340670

Number of length n+5 0..6 arrays with every six consecutive terms having five times some element equal to the sum of the remaining five. A249495