Properties of the Number 19443

Nineteen Thousand Four Hundred Forty-Three

Basics

Value: 19442 → 19443 → 19444

Parity: odd

Prime: No

Previous Prime: 19441

Next Prime: 19447

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 6481

Divisors: 1, 3, 6481, 19443

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101111110011

Octal: 45763

Duodecimal: B303

Hexadecimal: 4bf3

Square: 378030249

Square Root: 139.43815833551446

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

a(n)*n = A112904(n). A112905

E.g.f.: A(x) = (exp(x)/(3 - 2·exp(x)))^1/3. A136727

Sum of the sizes of the kernels of all integer partitions of n. A218904

Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + x)/(1 - 2·x - 9·x² - 2·x³). A179604

a(n) = n - A354203(σ(A354202(n))), where A354202 is fully multiplicative with a(p) = A354200(A000720(p)), and A354203 is its left inverse. A354207

Numbers whose concatenation of prime factors (with multiplicity) is a square. A38693

Expansion of ∑_i>=1 μ(i)²*xⁱ/(1 - xⁱ) * ∏_j>=i 1/(1 - μ(j)²*x^j), where μ() is the Moebius function (A008683). A284829

a(n) is the smallest integer k such that the Diophantine equation x³ + y³ + z³ = k³ has exactly n positive primitive integer solutions. A391773

Expansion of 1/((1-4x)(1-6x)(1-9x)). A19443

Triangle T(n,k) of series-reduced (or homeomorphically irreducible) graphs with loops on n labeled nodes and with k edges, k=0..binomial(n+1,2). A60517