Properties of the Number 1793

One Thousand Seven Hundred Ninety-Three

Basics

Value: 1792 → 1793 → 1794

Parity: odd

Prime: No

Previous Prime: 1789

Next Prime: 1801

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

8509 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

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

Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5), a(0)=a(1)=a(2)=a(3)=0, a(4)=1. A1591

Numbers k such that the k-th partition number A000041(k) is prime. A46063

Number of points of norm <= n² in square lattice. A328

Except a(0)=1 and a(4)=0, number of integer partitions of n with no 1's and at least two parts. A379720

G.f.: ∏_k>=1 1/(1+x^k)^k. A255528

Triangle read by rows: T(n,0) = T(n,n) = 1 and for 0<k<n: T(n,k) = 2·T(n-1, k-1) + T(n-1,k). A119258

Array T(d,n) = number of integer lattice points inside the d-dimensional hypersphere of radius sqrt(n), read by ascending antidiagonals. A122510