Properties of the Number 12686

Twelve Thousand Six Hundred Eighty-Six

Basics

Value: 12685 → 12686 → 12687

Parity: even

Prime: No

Previous Prime: 12671

Next Prime: 12689

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 6343

Divisors: 1, 2, 6343, 12686

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000110001110

Octal: 30616

Duodecimal: 7412

Hexadecimal: 318e

Square: 160934596

Square Root: 112.63214461245067

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

T(n,k) = Number of n X k nonnegative integer arrays with upper left 0 and lower right n+k-4 and value increasing by 0 or 1 with every step right or down. A252876

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock. A236055

Number of binary strings of length n avoiding "squares" (that is, repeated blocks of the form xx) with |x| > 2. A229614

Numbers k such that A380459(k) has no divisors of the form p^p, while A003415(k) has such a divisor or is 0. A380474

Numbers k such that there is a smaller number m > 1 such that k·m equals the concatenation of digit-wise multiplication, keeping the leading digits of k when m has fewer digits. A392568

Numbers k such that 1 + binomial(k,j) is prime for only 2 values of j (0 <= j <= k). A67317

Let f(n) be 2n + POD(n) + 1 if n is even, otherwise 2n - POD(n) - 1, where POD(n) is the product of digits of n. Sequence gives smallest number requiring n iterations to reach a prime. A74808

Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m. A175356

Number of n X 4 nonnegative integer arrays with upper left 0 and lower right n+4-4 and value increasing by 0 or 1 with every step right or down. A252872

Number of nX7 nonnegative integer arrays with upper left 0 and lower right n+7-4 and value increasing by 0 or 1 with every step right or down. A252875