Properties of the Number -372096

Three Hundred Seventy-Two Thousand Ninety-Six

Basics

Value: -372097 → -372096 → -372095

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁷ × 3 ² × 17 × 19

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 17

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -1011010110110000000

Octal: -1326600

Duodecimal: -15B400

Hexadecimal: -5ad80

Square: 138455433216

Square Root: 609.996721302664

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) = F(4)*F(n)*F(n+1) + F(5)*F(n+1)² if n odd, a(n) = F(4)*F(n)*F(n+1) + F(5)*F(n+1)² - F(5) if n even, where F(n) is the n-th Fibonacci number (A000045). A80144

G.f.: 1/((1-x²)³*(1-x)⁴). A60099

a(n) = F(n)² + 4*(-1)ⁿ = F(n+3)*F(n-3), where F = A000045. A292612

If X₁,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 5-subsets of X containing none of X_i, (i=1,...n). A130811

Number of ways to occupy n unlabeled phone booths in a circle one by one, each time picking a phone booth adjacent to the smallest number of previously occupied phone booths. A276657

Coordination sequence for diamond structure D^+_6. (Edges defined by l₁ norm = 1.) A35879

a(n) = (n + 4)*(n + 3)*(n + 2)*(n + 1)*n / 5 = 24·A000389(n+4). A158874

Denominators of r(n) := ∑_k=0..n-1 1/∏_j=0..4 (k + j + 1), for n >= 0, with r(0) = 0. A300299

Triangle read by rows: T(n,k) = number of colored weighted Motzkin paths ending at (n,k). A293172