Properties of the Number -2382

Three Hundred Eighty-Two

Basics

Value: -2383 → -2382 → -2381

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 397

Divisors: 1, 2, 3, 6, 397, 794, 1191, 2382

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100101001110

Octal: -4516

Duodecimal: -1466

Hexadecimal: -94e

Square: 5673924

Square Root: 48.80573736764972

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

E.g.f.: exp(2*(1-exp(x))). A213170

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. exp(k*(1 - exp(x))). A292861

Triangle read by rows. T(n, k) = BellPolynomial(n, -k). A350263

a(0) = -1 and a(n) = (-1)ⁿ⁺¹*(3·n² - n + 4)/2 for n >= 1. A173247

G.f.: ∏_n>=1 (1 - 2·xⁿ)³. A322216

Triangle: q=2; m=1; t(n,k) = If[m == 0, n!, Product[Sum[(-1)ⁱ*StirlingS2[ k - 1, i]*(m + 1)ⁱ, {i, 0, k - 1}], {k, 1, n}]]; b(n,k,m) = If[n == 0, 1, t[n, m]/(t[k, m]*t[n - k, m])]. A156593

a(n) = 2*(n² - n + 1). A51890

Number of integer partitions of n whose first differences (assuming the last part is zero) are unimodal. A332283

Numbers that are the sum of 9 positive 6th powers. A3365

a(n) = solution to the postage stamp problem with 3 denominations and n stamps. A1208