Properties of the Number -14688

Fourteen Thousand Six Hundred Eighty-Eight

Basics

Value: -14689 → -14688 → -14687

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ³ × 17

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 17

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11100101100000

Octal: -34540

Duodecimal: -8600

Hexadecimal: -3960

Square: 215737344

Square Root: 121.19405926034493

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

G.f.: ∑_n=-oo..+oo x^n² * C(x)^4·n-4, where C(x) = 1 + x·C(x)² is the g.f. of the Catalan numbers (A000108). A356778

G.f.: ∑_n=-oo..+oo x^n*(n+1/2) * C(x)^3·n-3, where C(x) = 1 + x·C(x)² is the g.f. of the Catalan numbers (A000108). A355348

Coefficient array for the powers of x² of the square of the even-indexed Chebyshev C polynomials. A220668

Coefficient array for the third power of the monic integer Chebyshev polynomials 2·T(2·n,x/2) as a function of x². A219236

Number of divisors of n!. A27423

Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers): Triangle T(n,k) = number of ways to get k matches for a deck with n cards, 2 of each kind. A59056

a(n) = n*(n+1)*(n+2)²/6. A4320

Expansion of (1-x)^-3 * (1-x²)^-2. A2624

a(n) = floor(n*(n-1)*(n-2)*(n-3)/5). A11915

L.g.f.: log( ∑_n>=0 x^n² ), the log of the characteristic function of the squares. A162552