Properties of the Number 19863

Nineteen Thousand Eight Hundred Sixty-Three

Basics

Value: 19862 → 19863 → 19864

Parity: odd

Prime: No

Previous Prime: 19861

Next Prime: 19867

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 2207

Divisors: 1, 3, 9, 2207, 6621, 19863

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110110010111

Octal: 46627

Duodecimal: B5B3

Hexadecimal: 4d97

Square: 394538769

Square Root: 140.93615575855614

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 non-isomorphic intersecting set-systems of weight n. A306006

Number of subset-sums of strict integer partitions of n. A365925

Riordan array (1/(1-x·c(3·x)), x·c(3·x)/(1-x·c(3·x))), c(x) the g.f. of A000108. A110519

Irregular array read by rows: A(n,k) = number of first coronas of a fixed rhombus r_n,k with characteristics of n-fold rotational symmetry in the Euclidean plane, n>=2, 1<=k<=floor(n/2), as explained below. A233332

Number of partitions of n in which number of least parts is equal to least part. A96403

Number T(n,k) of partitions of [n] having exactly k parity changes within the partition, n>=0, 0<=k<=max(0,n-1), read by rows. A363519

Signed recurrence over binary enriched p-trees: a(n) = (-1)^n-1 + ∑_{x + y = n, 0 < x <= y < n} a(x) * a(y). A300865

a(n) = ceiling(n*φ¹⁶), where φ is the golden ratio, A001622. A4971

a(n) = round(n*φ¹⁶), where φ is the golden ratio, A001622. A4951

Numbers k such that k and 4k, taken together, contain all digits 1 though 9 at least once. A346135