Properties of the Number -6140

One Hundred Forty

Basics

Value: -6141 → -6140 → -6139

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 × 307

Divisors: 1, 2, 4, 5, 10, 20, 307, 614, 1228, 1535

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011111111100

Octal: -13774

Duodecimal: -3678

Hexadecimal: -17fc

Square: 37699600

Square Root: 78.35815209663893

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

Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a1,a1,a2,a2,a3,a3,...). A51165

a(n) = a(n-2) - (a(n-1) - a(n-2)) if (n mod 2) = 0, otherwise a(n) = a(n-1) - (a(n-3) - a(n-4)), with a(0) = 0, a(1) = 1, a(2) = -1, a(3) = 2. A135690

a(n) = 4 - 3·2ⁿ. A165751

Number of non-isomorphic strict multiset partitions of weight n. A316980

a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks. A347789

Square array A(n, k) = σ(A246278(n, k)), read by falling antidiagonals. A355927

Binomial transform of [1, 1, 5, 1, 5, 1, 5, ...]. A131128

Sum of the ninth largest parts of the partitions of n into 10 squarefree parts. A326629

Maximal length of rook tour on an n X n board. A6071

Reverse and add (in base 4). A35524