Properties of the Number -16686

Sixteen Thousand Six Hundred Eighty-Six

Basics

Value: -16687 → -16686 → -16685

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ⁴ × 103

Divisors: 1, 2, 3, 6, 9, 18, 27, 54, 81, 103

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000100101110

Octal: -40456

Duodecimal: -97A6

Hexadecimal: -412e

Square: 278422596

Square Root: 129.1743008496659

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) = - 4·a(n-2) - a(n-4), a(0) = 1, a(1) = -4, a(2) = -6, a(3) = 15. A109731

a(n) = 4·a(n-1) - a(n-2), a(0)=1, a(1)=6. A54491

Expansion of (3·x+1)/(1-3·x-3·x²). A108306

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero. A317118

a(n) = (2·n + 1)*(5·n + 6). A153127

Triangle read by rows: T(n,k) is the number of acyclic digraphs on n unlabeled nodes with k arcs and a global source and sink, n >= 1, k = 0..n*(n-1)/2. A350491

Combined Diophantine Chebyshev sequences A054491 and A077234. A77237

Number of ways to write n as an ordered sum of nine positive Fibonacci numbers (with a single type of 1). A357717

Start with 1 and repeatedly reverse the digits and add 55 to get the next term. A118161

a(0)=a(1)=1; a(n) = 3*(a(n-1) + a(n-2)). A134927