Properties of the Number 41160

Forty-One Thousand One Hundred Sixty

Basics

Value: 41159 → 41160 → 41161

Parity: even

Prime: No

Previous Prime: 41149

Next Prime: 41161

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 7 ³

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010000011001000

Octal: 120310

Duodecimal: 1B9A0

Hexadecimal: a0c8

Square: 1694145600

Square Root: 202.87927444665215

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

Expansion of g.f.: (1+x)/(1-14·x). A170734

Numbers whose prime factors span an initial interval of prime numbers and whose sequence of prime multiplicities is a palindrome. A317087

Number T(n,k) of endofunctions on [n] where the smallest cycle length equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A246049

Number T(n,k) of endofunctions on [n] whose cycle lengths are multiples of k; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. A246609

A partition product of Stirling₂ type [parameter k = 1] with biggest-part statistic (triangle read by rows). A157401

Number T(n,k) of endofunctions on [n] with all cycles of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A243098

Triangle of idempotent numbers binomial(n,k)*k^n-k, version 4. A59300

Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)² = (S_i S_j)¹⁶ = I. A167923

Consider coefficients U(m,L,k) defined by the identity ∑_k=1..L ∑_j=0..m A302971(m,j)/A304042(m,j) * k^j * (T-k)^j = ∑_k=0..m (-1)^m-k * U(m,L,k) * T^k that holds for all positive integers L,m,T. This sequence gives 4-column table read by rows, where the n-th row lists coefficients U(3,n,k) for k = 0, 1, 2, 3; n >= 1. A316387

Chromatic polynomial of the star graph on 4 vertices (claw graph) and the path graph on 4 vertices. A179824