Properties of the Number 6117

Six Thousand One Hundred Seventeen

Basics

Value: 6116 → 6117 → 6118

Parity: odd

Prime: No

Previous Prime: 6113

Next Prime: 6121

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 2039

Divisors: 1, 3, 2039, 6117

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1011111100101

Octal: 13745

Duodecimal: 3659

Hexadecimal: 17e5

Square: 37417689

Square Root: 78.21125238736431

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

Partial sums of A299279. A299280

a(n) = floor(n*φ¹²), where φ is the golden ratio, A001622. A4927

Triangle T read by rows: T(m,n) = number of convex polyominoes with an m+1 X n+1 minimal bounding rectangle, m > 0, n <= m. A93118

Partial sums of A007694. A174030

G.f.: ∑_n>=0 xⁿ / [∑_k>=0 C(n+k-1,k)²*(-x)^k]ⁿ. A184355

Expansion of ∏_k>=1 1/(1 - x^k*(k+1/2))². A298435

a(n) = (n³ + 3·n - 2)/2. A132127

a(n) = ∑_d∣n lcm(τ(d), pod(d)) where τ(k) is the number of divisors of k (A000005) and pod(k) is the product of divisors of k (A007955). A334793

Number of convex polyominoes with a 3 X n+1 minimal bounding rectangle. A93119

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n having k cells in the second column (n>=1, k>=0). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121581