Properties of the Number -14128

Fourteen Thousand One Hundred Twenty-Eight

Basics

Value: -14129 → -14128 → -14127

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 883

Divisors: 1, 2, 4, 8, 16, 883, 1766, 3532, 7064, 14128

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11011100110000

Octal: -33460

Duodecimal: -8214

Hexadecimal: -3730

Square: 199600384

Square Root: 118.86126366482901

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

Expansion of 1/(1 + x*∏_k>=1 (1 - x^k)). A331484

G.f. A(x) satisfies: A(x) = (1 + x·A(x)³) / (1 - x). A346626

a(n) = a(n-1) + a(n-9) for n >= 9; a(n) = 1 for n=0..7; a(8) = 2. A5711

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 1,1 0,-1 -1,1 or 0,-2. A264244

a(n) = ∑_k=1..n floor(n/k)³. A318742

Smallest base b > 1 such that both prime(n) and prime(n+1) are base-b Wieferich primes, i.e., p = prime(n) satisfies b^p-1 == 1 (mod p²) and q = prime(n+1) satisfies b^q-1 == 1 (mod q²). A259075

a(n) = ∑_{k=0..floor(n/3)} binomial(3·n-8·k,k). A373640

Number of binary rooted trees with n nodes and internal path length n. A108643

Positive integers of the form (7·m²+1)/11. A179370

Row sums of A285117: a(n) = 2 + ∑_k=1..(n-1) C(n-1,k-1) XOR C(n-1,k), a(0) = 1, a(1) = 2. A285114