Properties of the Number -41041

Forty-One Thousand Forty-One

Basics

Value: -41042 → -41041 → -41040

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 7 × 11 × 13 × 41

Divisors: 1, 7, 11, 13, 41, 77, 91, 143, 287, 451

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010000001010001

Octal: -120121

Duodecimal: -1B901

Hexadecimal: -a051

Square: 1684363681

Square Root: 202.58578429889891

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 1/(1 - 2·x + 5·x²)^5/2. A374508

Carmichael numbers: composite numbers k such that a^k-1 == 1 (mod k) for every a coprime to k. A2997

Least Carmichael number with n prime factors, or 0 if no such number exists. A6931

Euler pseudoprimes: composite numbers n such that 2^(n-1/2) == +-1 (mod n). A6970

Euler-Jacobi pseudoprimes: 2^(n-1/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol. A47713

Euler pseudoprimes to base 3: composite integers such that abs(3^{(n - 1}/2)) == 1 mod n. A262051

Euler pseudoprimes to base 5: composite integers such that abs(5^{(n - 1}/2)) == 1 mod n. A262052

Sum of next n squares. A72474

Composite numbers k such that k == +-1 (mod 8) and 2^(k-1/2) == 1 (mod k). A6971

Base-3 Euler-Jacobi pseudoprimes. A48950