Properties of the Number -1683

Six Hundred Eighty-Three

Basics

Value: -1684 → -1683 → -1682

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 11 × 17

Divisors: 1, 3, 9, 11, 17, 33, 51, 99, 153, 187

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11010010011

Octal: -3223

Duodecimal: -B83

Hexadecimal: -693

Square: 2832489

Square Root: 41.02438299353203

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 r(q³) / r(q)³ in powers of q where r() is the Rogers-Ramanujan continued fraction. A285583

Coefficients of the C-Rogers-Selberg identity. A104410

Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of A203947. A203948

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

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

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

Triangle read by rows: T(0,0) = 1; T(n,k) = 2 T(n-1,k) - 3 T(n-1,k-1) + T(n-1,k-2) for k = 0..2n; T(n,k)=0 for n or k < 0. A318685

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A385016. A385020

Central Delannoy numbers: a(n) = ∑_k=0..n C(n,k)*C(n+k,k). A1850

Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals. A8288