Properties of the Number 41308

Forty-One Thousand Three Hundred Eight

Basics

Value: 41307 → 41308 → 41309

Parity: even

Prime: No

Previous Prime: 41299

Next Prime: 41333

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 23 × 449

Divisors: 1, 2, 4, 23, 46, 92, 449, 898, 1796, 10327

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010000101011100

Octal: 120534

Duodecimal: 1BAA4

Hexadecimal: a15c

Square: 1706350864

Square Root: 203.24369608920225

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

a(n) is the coefficient of xⁿ/n! in exp(x + n·x²/2). A277614

The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts. A102186

For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of u²+v². A345434

Index in A092243 where -n first appears. A269738

Number of noncongruent integer-sided 5-dimensional simplices with largest side n. A97127

Least integer k > 1 such that π(k)² + π(k·n)² is a square, where π(.) is the prime-counting function given by A000720. A255677

Sequence obtained from Fibonacci numbers by taking the factorials of each digit and summing. A164955

Number of base 20 circular n-digit numbers with adjacent digits differing by 8 or less. A125455

Coefficients of infinite sum polynomials; p(x,n)=If[Mod[n, 2] == 1, (1 - x)^{n + 1}*Sum[(k + 1)*(1 + k + k²)^Floor[(n - 1)/2]* x^k, {k, 0, Infinity}], (1 - x)^{n + 1}*Sum[(1 + k + k²)^Floor[n/2]*x^ k, {k, 0, Infinity}]]. A169625

Array read by ascending antidiagonals. T(n, k) = n!*[xⁿ] exp(x + (k/2) * x²). A generalization of the number of involutions (or of 'telephone numbers'). A359762