Properties of the Number -40054

Forty Thousand Fifty-Four

Basics

Value: -40055 → -40054 → -40053

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 7 × 2861

Divisors: 1, 2, 7, 14, 2861, 5722, 20027, 40054

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001110001110110

Octal: -116166

Duodecimal: -1B21A

Hexadecimal: -9c76

Square: 1604322916

Square Root: 200.13495446822876

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

T(n,k)=Number of length n+5 0..k arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms. A250081

L.g.f.: ∑_n>=1 xⁿ/n * ∏_d∣n (1 + d·xⁿ)^d. A205483

Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 (i.e., E steps from the line y=x+1 to the line y = x). A110098

Number of length n+5 0..6 arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms. A250079

Number of length 1+5 0..n arrays with every six consecutive terms having the maximum of some two terms equal to the minimum of the remaining four terms. A250082

Binomial transform of the continued fraction expansion of e. A306809

Numbers where the difference of consecutive fifth powers is "close" to another fifth power: let m = k⁵ - (k-1)⁵; sequence lists the numbers k where m - floor(m^1/5)⁵ < floor(sqrt(k))⁵. A53804