Properties of the Number -16681

Sixteen Thousand Six Hundred Eighty-One

Basics

Value: -16682 → -16681 → -16680

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 7 × 2383

Divisors: 1, 7, 2383, 16681

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000100101001

Octal: -40451

Duodecimal: -97A1

Hexadecimal: -4129

Square: 278255761

Square Root: 129.15494570476193

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

Numbers k such that k!!! + 1 is prime (0 is included by convention). A37083

T(n,k) = number of length-n 0..k arrays with no adjacent pair x,x+1 repeated: infinite square array read by falling antidiagonals. A269656

a(n) = (1/3!)*(n³ + 24·n² + 107·n + 90), compare A059604. A59605

a(n) is the smallest integer k such that the n-th (forward) difference of the partition sequence A000041 is positive from k onwards. A119712

Number of maximal matchings in the n-antiprism graph. A284701

Number of length-5 0..n arrays with no adjacent pair x,x+1 repeated. A269658

a(n) = ∑_k=1..n sigma₃(k) * floor(n/k). A356043

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 78 ones. A31846

Number of length-n 0..6 arrays with no adjacent pair x,x+1 repeated. A269654

Number of solutions to rev(x²)=rev(x)² below 10ⁿ. A98690