Properties of the Number 18579

Eighteen Thousand Five Hundred Seventy-Nine

Basics

Value: 18578 → 18579 → 18580

Parity: odd

Prime: No

Previous Prime: 18553

Next Prime: 18583

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 × 563

Divisors: 1, 3, 11, 33, 563, 1689, 6193, 18579

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100100010010011

Octal: 44223

Duodecimal: A903

Hexadecimal: 4893

Square: 345179241

Square Root: 136.3048054912225

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

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

Number of isomorphism classes of connected 3-regular loopless multigraphs with n vertices and with semi-edges allowed. A243391

Irregular table read by rows, T(n, k) is the rank of the k-th Seidel permutation of {1,...,n}, permutations sorted in lexicographical order. A347600

Expansion of (1/x) * Series_Reversion( x / (1 + x³ / (1 - x)⁴) ). A389251

a(n) = max{T(n,k), k=1..n}, where T(n,k) is the number of Dyck paths of length 2n and height k (1<=k<=n). A259885

Number of Dyck paths of semilength n and height exactly 4. A262600

a(n) = 9 + floor((3 + ∑_j=1..n-1 a(j))/4). A120167

Number of isomorphism classes of connected 3-regular simple graphs of order 2n with loops and semi-edges allowed. A243392

Number of unlabeled connected loopless multigraphs with n nodes of degree 3 or less and with single or double edges. A303030

Expansion of o.g.f. (1-x²+x⁴)/((1-x)²*(1-x²)⁴*(1-x³)⁴). A123991