Properties of the Number -3882

Eight Hundred Eighty-Two

Basics

Value: -3883 → -3882 → -3881

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 647

Divisors: 1, 2, 3, 6, 647, 1294, 1941, 3882

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -111100101010

Octal: -7452

Duodecimal: -22B6

Hexadecimal: -f2a

Square: 15069924

Square Root: 62.30569797378086

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=1..n (-1)^n-k*binomial(n,k)*σ(k). A320568

Expansion of ∏_m>=1 (1 - m·q^m)². A22662

Cardinality of set of sets of parts of all partitions of n. A88314

Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 24. A51989

Numbers k such that 2^k + 15 is prime. A57197

Number of partitions where no part is a multiple of 9. A104502

G.f.: (1+x⁸+x⁹+x¹⁰+x¹⁸)/((1-x²)*(1-x³)*(1-x⁴)*(1-x⁵)*(1-x⁶)*(1-x⁷)). A97851

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..3 nXk array. A218522

T(n,k)=Number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors. A200871

Numbers whose sum of divisors is a fifth power. A19423