Properties of the Number 18712

Eighteen Thousand Seven Hundred Twelve

Basics

Value: 18711 → 18712 → 18713

Parity: even

Prime: No

Previous Prime: 18701

Next Prime: 18713

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 2339

Divisors: 1, 2, 4, 8, 2339, 4678, 9356, 18712

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100100100011000

Octal: 44430

Duodecimal: A9B4

Hexadecimal: 4918

Square: 350138944

Square Root: 136.79181262049275

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

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2X2 subblock. A235893

T(n,k)=Number of nXk 0..3 arrays avoiding 11 horizontally, 22 vertically, 33 antidiagonally and 00 diagonally. A229412

Number of n X 2 0..3 arrays avoiding 11 horizontally, 22 vertically, 33 antidiagonally and 00 diagonally. A229406

Number of nX4 0..3 arrays avoiding 11 horizontally, 22 vertically, 33 antidiagonally and 00 diagonally. A229408

Number of (n+1) X (2+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock. A235887

Number of (n+1) X (6+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock. A235891

Expansion of ∏_k>=1 ((1 - k·x^k) / (1 + k·x^k))^k. A305745

a(n) is the number of overpartitions of n where overlined parts are not divisible by 3 and non-overlined parts are congruent to 1 modulo 3. A335754

a(n) = (21·n² + 9·n + 2)/2. A381109

A triangular sequence of polynomial coefficients:p(x,n)=Sum[Eulerian[n + 1, k]*Product[x + i, {i, 0, n - k + 1}]*(-x)^k, {k, 0, n}]/x. A174833