Properties of the Number -51128

Fifty-One Thousand One Hundred Twenty-Eight

Basics

Value: -51129 → -51128 → -51127

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 7 × 11 × 83

Divisors: 1, 2, 4, 7, 8, 11, 14, 22, 28, 44

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100011110111000

Octal: -143670

Duodecimal: -25708

Hexadecimal: -c7b8

Square: 2614072384

Square Root: 226.11501498131432

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

a(n) = n*(n+2)*(2·n-1)/3. Also, row sums of triangle A131422. A131423

a(n) = A273059(4n+3). A275919

Number of monohedral disk tilings of type C^t_{5,n}. A296362

a(n) = ∑_{k=0..floor(n/4)} 2^n-4·k * binomial(2·n-6·k+1,2·k+1). A387696

T(n, k) = A343277(n)*[x^k] p(n, x) where p(n, x) = (1/(n+1))*∑_k=0..n (-1)^k*E1(n, k)*x^{n - k} / binomial(n, k), and E1(n, k) are the Eulerian numbers A123125. Triangle read by rows, for 0 <= k <= n. A342321

a(n) is equal to the sum of the factorials of the digits of a(n-1), with a(1) = 0; each time a duplicated term appears, we replace it with the smallest integer not yet in the sequence and iterate. A351328

A129065 with v=n instead of v=1: recursive polynomial coefficient triangle. A136453

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (1, 0, -1), (1, 0, 1), (1, 1, 0)}. A150753

a(n) = 4*(n + 1)*(n + 2)*(4·n + 3)/3. A267522

Rectangular array A read by upward antidiagonals in which the entry A(n,k) in row k and column n gives the number of families of symmetric radially generated monohedral tilings of the disk (each tiling contains 2*(2·n+1)*k congruent tiles), k >= 1, n >= 1. A273090