Properties of the Number -41990

Forty-One Thousand Nine Hundred Ninety

Basics

Value: -41991 → -41990 → -41989

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 13 × 17 × 19

Divisors: 1, 2, 5, 10, 13, 17, 19, 26, 34, 38

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010010000000110

Octal: -122006

Duodecimal: -20372

Hexadecimal: -a406

Square: 1763160100

Square Root: 204.91461636496308

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

Third convolution of A115140. A115142

a(n) = 3*(2·n)!/((n+2)!*(n-1)!). A245

Catalan's triangle with right border removed (n > 0, 0 <= k < n). A30237

a(n) = 3·binomial(2n, n-1)/(n+2), n > 0, with a(0)=1. A71724

Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (10,n)-rectangular grid with k '1's and (10n-k) '0's: two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other. A228169

a(n) = (1/n!) * (5·n)!/(5·n/2)! * (3·n/2)!/(3·n)!. A262732

Normalized triangle of odd numbered entries of even numbered rows of Pascal's triangle A007318. A91043

Triangle T(n,k) = lcm(1,...,2·n+2)/((k+1)*binomial(2·k+2,k+1)). A120101

Expansion of 1/(1-4·x)^13/2. A20924

Triangle T(n,k), k>=0 and n>=1, read by rows defined by: T(n,k) = (2k+3)*binomial(2n,n-k-1)/(n+k+2). A50155