Properties of the Number -41506

Forty-One Thousand Five Hundred Six

Basics

Value: -41507 → -41506 → -41505

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 20753

Divisors: 1, 2, 20753, 41506

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010001000100010

Octal: -121042

Duodecimal: -2002A

Hexadecimal: -a222

Square: 1722748036

Square Root: 203.73021376320204

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

Number of non-condensed integer partitions of n, or partitions where it is not possible to choose a different divisor of each part. A370320

Array read by antidiagonals: poly-Bernoulli numbers B(-k,n). A99594

Number A(n,k) of acyclic orientations of the Turán graph T(n,k); square array A(n,k), n>=0, k>=1, read by antidiagonals. A267383

Number of acyclic orientations of the Turán graph T(n,2). A266695

Numbers that are the sum of seven fourth powers in exactly eight ways. A345830

Poly-Bernoulli numbers B_n^k with k=-4. A27651

Number of ways to choose four collinear points from an n X n grid. A178256

Number T(n,k,j) of acyclic orientations of the complete tripartite graph K_n,k,j; triangle of triangles T(n,k,j), n>=0, k=0..n, j=0..k, read by rows. A372261

E.g.f.: ∑_n>=0 (1 - exp(-(n+1)*x))ⁿ/(n+1). A188634

Poly-Bernoulli numbers B_n^k with k = -5. A283811