Properties of the Number -5661

Six Hundred Sixty-One

Basics

Value: -5662 → -5661 → -5660

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 17 × 37

Divisors: 1, 3, 9, 17, 37, 51, 111, 153, 333, 629

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1011000011101

Octal: -13035

Duodecimal: -3339

Hexadecimal: -161d

Square: 32046921

Square Root: 75.23961722390672

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 (q·j(q))^1/8 where j(q) is the elliptic modular invariant (A000521). A289298

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and height k (1 <= k <= n). A80936

Coefficient of x⁴ in expansion of (1+x+x²)ⁿ. A5712

Number of fully normal integer partitions of n. A317491

Triangulations of the disk G_n,0. A2709

Square array T(n,m) (n>=0, m>=0) read by antidiagonals downwards giving number of rooted triangulations of type [n,m] up to orientation-preserving isomorphisms. A262586

Smallest Rhonda number to base b = n-th composite number, A002808(n). A255872

Positive numbers whose product of digits is 10 times their sum. A62043

a(n) = n³ - n*(n+1)/2. A160378

T(n,k)=Number of (n+3)X(k+3) binary arrays with every 4X4 subblock commuting with each horizontal and vertical neighbor 4X4 subblock. A188105