Properties of the Number 6081

Six Thousand Eighty-One

Basics

Value: 6080 → 6081 → 6082

Parity: odd

Prime: No

Previous Prime: 6079

Next Prime: 6089

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 2027

Divisors: 1, 3, 2027, 6081

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1011111000001

Octal: 13701

Duodecimal: 3629

Hexadecimal: 17c1

Square: 36978561

Square Root: 77.9807668595276

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

Galton triangle T(n, k) = T(n-1, k-1) + (3k-2)*T(n-1, k) read by rows. A111577

Concentric 16-gonal numbers. A195146

T(n,k) = Number of n X k 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors. A283691

Third row of number array A082105. A82109

The O(1) loop model on the square lattice is defined as follows: At every vertex the loop turns to the left or to the right with equal probability, unless the vertex has been visited before, in which case the loop leaves the vertex via the unused edge. Every vertex is visited twice. The probability that a face of the lattice on an n X infinity cylinder is surrounded by one loop is conjectured to be given by a(n)/A_HT(n)², where A_HT(n) is the number of n X n half turn symmetric alternating sign matrices. A92373

T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,0) or (-1,1) and new values introduced in order 0..2. A275183

Sum of primes < 2ⁿ. A130739

a(n) = ∑_{1 <= i, j, k <= n} gcd(i,j,k). A344522

Expansion of 1/((1-x) * (1-4·x) * (1-7·x)). A16223

Consider the Diophantine equation x³ + y³ = z³ - 1 (0 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of z. A50787