Properties of the Number -41110

Forty-One Thousand One Hundred Ten

Basics

Value: -41111 → -41110 → -41109

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 4111

Divisors: 1, 2, 5, 10, 4111, 8222, 20555, 41110

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010000010010110

Octal: -120226

Duodecimal: -1B95A

Hexadecimal: -a096

Square: 1690032100

Square Root: 202.75601100830525

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

Coefficient array for powers of x² of polynomials appearing in a generalized Melham conjecture on alternating sums of fifth powers of Chebyshev S polynomials with odd indices. A220671

Number of integer partitions of n of which every permutation has a consecutive monotone triple, i.e., a triple (..., x, y, z, ...) such that either x <= y <= z or x >= y >= z. A344654

Number of Aut(G)-orbits on G-characters that come from Riemann surfaces of genus n. A347373

The sequence b[n] defined in A126940. A126946

Numbers n = x0 x1 x2...x9 such that ξ is the number of digits greater than i in n. A226195

Number of minimal edge cuts in the n-Plummer-Toft graph. A378924

a(n) = sum of cubes of p(j) - p(i), for 0 <= i < j <= n, where p(0) = 1. A24527