Properties of the Number 13986

Thirteen Thousand Nine Hundred Eighty-Six

Basics

Value: 13985 → 13986 → 13987

Parity: even

Prime: No

Previous Prime: 13967

Next Prime: 13997

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 7 × 37

Divisors: 1, 2, 3, 6, 7, 9, 14, 18, 21, 27

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011010100010

Octal: 33242

Duodecimal: 8116

Hexadecimal: 36a2

Square: 195608196

Square Root: 118.26242006656214

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

When expressed in base 3 and then interpreted in base 7, is a multiple of the original number. A62884

Numbers k such that k⁶ + 1091 is prime. A66386

Number of ways to write n as an ordered sum of 9 squares of positive integers. A340946

Numbers k such that k and 6·k are anagrams. A23090

Numbers that have exactly six prime factors counted with multiplicity (A046306) whose digit reversal is different and also has 6 prime factors (with multiplicity). A109026

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >=3, where u = p(2,x), v = 2 - x². A368151

A Wallis pair (x,y) satisfies σ(x²) = σ(y²); sequence gives x's for indecomposable Wallis pairs with x < y (ordered by values of x). A75768

Rectangular table, read by antidiagonals, where row n is equal to column 0 of matrix power A121412ⁿ⁺¹ for n>=0. A121424

Number of subpartitions of partition P=[0,1,1,2,2,2,3,3,3,3,4,...] (A003056). A121430

Square array, read by antidiagonals, where T(n,k) = T(n,k-1) + T(n-1,k+n) for n>0, k>0, such that T(n,0) = T(n-1,n) for n>0 with T(0,k)=1 for k>=0. A136733