Properties of the Number -16968

Sixteen Thousand Nine Hundred Sixty-Eight

Basics

Value: -16969 → -16968 → -16967

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 7 × 101

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100001001001000

Octal: -41110

Duodecimal: -99A0

Hexadecimal: -4248

Square: 287913024

Square Root: 130.26127590347025

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

tanh(sinh(x)*tan(x)) = 2/2!*x² + 12/4!*x⁴ - 98/6!*x⁶ - 16968/8!*x⁸ - ... A9816

Expansion of sin(x)*cosh(log(1+x)). A9537

Expansion of e.g.f. arctan(sinh(x)*tan(x)) (even powers only). A12548

Duplicate of A009816. A12550

T(n,k) is the number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero with no three beads in a row equal. A209344

Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) if n>=5, and a(n) = n otherwise. A135056

Number of homogeneous primitive partition identities with largest part n. A7343

a(n) = (n+1)*(n+2)²*(n+3)*(n+4)*(5·n² + 18·n + 15)/720. A107962

Number of partitions of 3n-1 into n nonnegative integers each no more than 6. A1978

a(n+1) = a(n) converted to base 9 from base 6 (written in base 10). A23386