Properties of the Number -37130

Thirty-Seven Thousand One Hundred Thirty

Basics

Value: -37131 → -37130 → -37129

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 47 × 79

Divisors: 1, 2, 5, 10, 47, 79, 94, 158, 235, 395

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001000100001010

Octal: -110412

Duodecimal: -195A2

Hexadecimal: -910a

Square: 1378636900

Square Root: 192.69146322554096

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

a(n) = ∑_k=0..n binomial(6·n,6·k). A70967

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction. A250877

Cogrowth sequence of the 12-element group C6 X C2 = <S,T | S⁶, T², [S,T]>. A377627

Number of achiral color patterns (set partitions) for a row or loop of length n using exactly 4 colors (sets). A304974

Cogrowth sequence for the 18-element group C6 X C3 = <S,T | S⁶, T³, [S,T]>. A378031

a(n) = ∑_{k=0..floor(n/6)} binomial(n,6·k). A306847

a(n) = ∑_{2·i+3·j=n, 0<=i<=n, 0<=j<=n} n!/( (2·i)!*(3·j)! ). A94715

Difference between sum of largest parts and sum of smallest parts of all partitions of n into an even number of parts. A211881

Array read by descending antidiagonals. A(n, k) is, if n > 0, the number of multiset permutations of {0, 1} of length n·k where the number of occurrences of 1 are multiples of n. A(0, k) = k + 1. A361043

Constant term of the reduction of the polynomial p(n,x)=(1/2)((x+2)ⁿ+(x-2)ⁿ) by x²->x+2. A192355