Properties of the Number -3291

Two Hundred Ninety-One

Basics

Value: -3292 → -3291 → -3290

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 1097

Divisors: 1, 3, 1097, 3291

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110011011011

Octal: -6333

Duodecimal: -1AA3

Hexadecimal: -cdb

Square: 10830681

Square Root: 57.367238037053866

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

G.f. satisfies: A(x) = exp( ∑_n>=1 A(-xⁿ)² * xⁿ/n ). A200438

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 429", based on the 5-celled von Neumann neighborhood. A272114

a(n) = (3·n² - n + 2)/2. A143689

a(n) = ∑_k=1..n floor(n/k) * (-4)^k-1. A344819

a(n) = ∑_{k=0..floor(n/4)} C(n-3·k,k+1). A98578

Bisection of toothpick sequence A139250. A159791

Expansion of 2/(1-x+sqrt(1-2·x-27·x²)). A217275

a(1) = 0, and for n > 1, a(n) = 2·a(A252463(n)) + [n == 1 (mod 2)]*[J(3∣n) == -1], where J is the Jacobi-symbol. A292255

Square array A(n,k), n >= 1, k >= 0, read by antidiagonals downwards, where A(n,k) = ∑_j=1..n floor(n/j) * (-k)^j-1. A344824

Integers whose ternary representation consists of concatenated runs A(1)C(1)B(1)A(2)C(2)B(2)...A(k)C(k)B(k), where A(i) is a run of 1's, B(i) a run of 0's, and C(i) a run of 2's, for i = 1..k. A371108