Properties of the Number 19320

Nineteen Thousand Three Hundred Twenty

Basics

Value: 19319 → 19320 → 19321

Parity: even

Prime: No

Previous Prime: 19319

Next Prime: 19333

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 7 × 23

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100101101111000

Octal: 45570

Duodecimal: B220

Hexadecimal: 4b78

Square: 373262400

Square Root: 138.99640283115244

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 trees with n unlabeled nodes. A55

a(n) = (prime(n)-1)*(prime(n)+1). A84920

"DHK[ 5 ]" (bracelet, identity, unlabeled, 5 parts) transform of 1,1,1,1,... A32246

Numbers n such that the multiplicative group modulo n is the direct product of 6 cyclic groups. A272596

Number of connected trivalent (or cubic) labeled graphs with 2n nodes. A4109

a(n) = ∑_k=0..n 3^n-k * binomial(n-1,n-k) * binomial(2·k,k). A360318

Number of 4-block ordered tricoverings of an unlabeled n-set. A60488

Triangle of coefficients of q in e.g.f. that satisfies: A(x,q) = exp( q·x*A(q·x,q) ), read by rows of [n*(n-1)/2 + 1] terms in row n for n>=0. A126265

Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with diameter k (0<=k<n). A294522

Square array A(n,k) = A326128(A388981(n, k)), read by descending antidiagonals. A388988