Properties of the Number -14088

Fourteen Thousand Eighty-Eight

Basics

Value: -14089 → -14088 → -14087

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 587

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 587, 1174

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11011100001000

Octal: -33410

Duodecimal: -81A0

Hexadecimal: -3708

Square: 198471744

Square Root: 118.69288099966232

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. A(x) satisfies: 1/(1 - x) = A(x)*A(x²)²*A(x³)³*A(x⁴)⁴* ... *A(x^k)^k* ... A307648

G.f. A(x) satisfies: 1 = ∑_n=-oo..oo (-x)^n*(n+1/2) * A(x)^n*(n-1/2), with A(0) = 0. A354661

a(n) = ∑_k=0..n binomial(n, floor(k/2))*2^n-k. A127358

Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed. A228963

Consider triangle in which n-th row contains the smallest set of n consecutive numbers whose LCM is divisible by primorial(n) (the product of first n primes). Sequence contains the first column. A83130

a(n) = ∑_k=1..n (-1)^k+1 * floor((n/k)³). A350222

One-quarter of the number of regions in the central square of an equal-armed cross with arms of length n (as in A331456). A337641

G.f. A(x) satisfies: A(x) = x + x² * exp(2 * ∑_k>=1 (-1)^k+1 * A(x^k) / k). A345243

Number of strings of numbers x(i=1..n) in 0..3 with sum i·x(i)² equal to n·9. A184435

Numbers·such that the base 10 representation of x² forms an arithmetic sequence when split into equal-sized chunks. A244660