Properties of the Number -1793

Seven Hundred Ninety-Three

Basics

Value: -1794 → -1793 → -1792

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 11 × 163

Divisors: 1, 11, 163, 1793

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11100000001

Octal: -3401

Duodecimal: -1055

Hexadecimal: -701

Square: 3214849

Square Root: 42.34383071948026

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

Logarithmic (or "LOG") transform of squares A000290. A33464

Triangle T(n,k) = (-1)^k * A119258(n,k) read by rows, 0 <= k <= n. A145661

a(n) = IntegerPart(PolyGamma(n, 2)). A144168

Values of n such that L(5) and N(5) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A226925

L.g.f.: log(∏_k>=1 (1 + k·x^k)) = ∑_n>=1 a(n)*xⁿ/n. A300786

Square array A(n,k), n >= 1, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. log(1 + ∑_j>=1 j^k * x^j/j!). A308484

Values z of primitive solutions (x, y, z) to the Diophantine equation 2·x³ + 2·y³ + z³ = 1. A338239

Number of strict integer partitions of n containing the sum of some subset of the parts. A variation of sum-full strict partitions. A364272

a(n) = (n-1)*2ⁿ + 1. A337

a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n² + 5)/6. A4006