Properties of the Number 13487

Thirteen Thousand Four Hundred Eighty-Seven

Basics

Value: 13486 → 13487 → 13488

Parity: odd

Prime: Yes

Previous Prime: 13477

Next Prime: 13499

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 13487

Divisors: 1, 13487

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010010101111

Octal: 32257

Duodecimal: 797B

Hexadecimal: 34af

Square: 181899169

Square Root: 116.13354381917397

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) = floor(n*φ¹⁴), where φ is the golden ratio, A001622. A4929

Primes p with q(p) + 1 also prime, where q(.) is the strict partition function (A000009). A234530

McKay-Thompson series of class 9B for the Monster group. A58091

a(n) = PrimePi(n³) - PrimePi(n)³, where PrimePi = A000720. A291538

Primes of the form : (p-n)/(n+1)=prime and (n+1)*p+n=prime. n=3. A152293

Middle of 3 consecutive prime numbers, p1, p2, p3, such that p1·p2·p3·d1·d2 = average of twin prime pairs; d1 (δ) = p2 - p1, d2 (δ) = p3 - p2. A153410

Number of triples (w,x,y) with all terms in {0,...,n} and w <= floor((x+y)/3). A212973

Lexicographically largest strictly increasing sequence of primes for which the continued square root map produces Feigenbaum's constant δ = 4.6692016... (A006890). A257809

a(n) = (-1)ⁿ + ∑_{k=0..floor((n-1)/2)} a(k) * a(n-2·k-1). A351973

Consider the family of multigraphs enriched by the species of odd sets. Sequence gives number of those multigraphs with n labeled edges. A98636