Properties of the Number -54888

Fifty-Four Thousand Eight Hundred Eighty-Eight

Basics

Value: -54889 → -54888 → -54887

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 2287

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 2287, 4574

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1101011001101000

Octal: -153150

Duodecimal: -27920

Hexadecimal: -d668

Square: 3012692544

Square Root: 234.28188150174995

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. satisfies A(x) = G(x/(1-x)⁴) where G(x) = 1 + x·G(x)⁴ is the g.f. of A002293. A213336

A total of n married couples, including a mathematician M and his wife, are to be seated at the 2n chairs around a circular table, with no man seated next to his wife. After the ladies are seated at every other chair, M is the first man allowed to choose one of the remaining chairs. The sequence gives the number of ways of seating the other men, with no man seated next to his wife, if M chooses the chair that is 3 seats clockwise from his wife's chair. A258664

T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns. A221736

Number of ways to write n as an ordered sum of 6 prime powers (including 1). A341135

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0ⁿ and T(n,k) = k * ∑_r=0..n binomial(n,r) * binomial(n+3·r+k,n)/(n+3·r+k) for k > 0. A378237

a(n) = 1728·n - 408. A157266

G.f.: ∏_n=-oo..+oo (1 + xⁿ*(1 + xⁿ)ⁿ). A293603

Number of length 5 arrays x(i), i=1..5 with x(i) in i..i+n and no value appearing more than 2 times. A250354

Triangle T(n,k) read by rows where T(n,k) is the number of ménage permutations that map 1 to k, with 3 <= k <= n. A332709

Number of n X 3 arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns. A221732