Properties of the Number -41176

Forty-One Thousand One Hundred Seventy-Six

Basics

Value: -41177 → -41176 → -41175

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 5147

Divisors: 1, 2, 4, 8, 5147, 10294, 20588, 41176

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010000011011000

Octal: -120330

Duodecimal: -1B9B4

Hexadecimal: -a0d8

Square: 1695462976

Square Root: 202.91870293297265

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

Triangle read by rows, T(n,k) = (2^k-1) * T(n-1,k) + T(n-1,k-1). A139382

Expansion of ∏_k>0 ((1-x^5k-2) * (1-x^5k-3)/((1-x^5k-1) * (1-x^5k-4)))⁴ in powers of x. A285444

Row lengths of table A174382. A240508

Partial sums of A084570. A84569

Expansion of 1/(1-x⁵-x⁶-x⁷-x⁸-x⁹-x¹⁰-x¹¹-x¹²-x¹³-x¹⁴-x¹⁵). A17846

Triangle T(n,k,2) read by rows (generalized q-Stirling numbers of second kind): T(n, k, q_) = (1/(q - 1)^k)*Sum[(-1)^{k - j}*q·Binomial[k + n, k -j] - Binomial[j + n, j, q - 1], {j, 0, k}], with q=2, where Binomial[,] is the Gaussian q-binomial coefficient as in A022166. A156823

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, 0), (1, -1, 0), (1, 0, -1)}. A148688