Properties of the Number -41066

Forty-One Thousand Sixty-Six

Basics

Value: -41067 → -41066 → -41065

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 20533

Divisors: 1, 2, 20533, 41066

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010000001101010

Octal: -120152

Duodecimal: -1B922

Hexadecimal: -a06a

Square: 1686416356

Square Root: 202.64747716169575

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

Antidiagonal triangular matrices of factorials as the example: M(3)={{0, 0, 1}, {0, 1, 2}, {1, 2, 6}}; the matrices are used to get characteristic polynomials and the triangular sequence is the coefficients of those characteristic polynomials. A137296

a(n) = ∑_k=1..n (2·k)!. A138524

Least number k such that A304036(k) = n. A304039

Array read by antidiagonals: T(m,n) = Sum(1<=i<=m) ( n + 2(i-1) )! A211368

Number of occurrences of k in the list of transitions t(j), j <= n!-1, of interchanges a(t(j)) <-> a(t(j)+1) created by Knuth's "Algorithm T" (Plain change transitions) to generate all permutations of n distinct elements, written as a triangle T(m,k), m = n-1 >= 1, k <= m. A321668

Partial sums of A005165. A341900

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

Sequence is obtained from Catalan numbers (A000108) by taking the factorial of each digit and adding them up. A165163