Properties of the Number -3661

Six Hundred Sixty-One

Basics

Value: -3662 → -3661 → -3660

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 523

Divisors: 1, 7, 523, 3661

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111001001101

Octal: -7115

Duodecimal: -2151

Hexadecimal: -e4d

Square: 13402921

Square Root: 60.50619802962338

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

Expansion of ∏_k>=1 (1 - x^k * (1 + k·x)). A336978

Triangle of numerators of coefficients of the polynomial Q³_m(n) defined by the recursion Q³_0(n)=1; for m>=1, Q³_m(n) = ∑_i=1...n i³*Q³_(m-1)(i). A202717

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

a(n) = 4·n² - 6·n + 3. A54569

Numbers k giving rise to prime quadruples (30k+11, 30k+13, 30k+17, 30k+19). A14561

Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (see Comments for precise definition). A160118

Triangle read by rows of differences of reciprocals of unity. A8969

a(n) = 9·n² + 3·n + 1. A82040

a(n) = A341529(n) - A341528(n) = (σ(n)*A003961(n)) - (n*σ(A003961(n))). A341512

Triangle from inverse scaled Pochhammer symbols. A112492