Properties of the Number 9886

Nine Thousand Eight Hundred Eighty-Six

Basics

Value: 9885 → 9886 → 9887

Parity: even

Prime: No

Previous Prime: 9883

Next Prime: 9887

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 × 4943

Divisors: 1, 2, 4943, 9886

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011010011110

Octal: 23236

Duodecimal: 587A

Hexadecimal: 269e

Square: 97732996

Square Root: 99.42836617384397

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

Strobogrammatic numbers: the same upside down. A787

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = a(3) = 2. A50047

Positive numbers k such that the centered cube number k³ + (k+1)³ is equal to the difference of two positive cubes and to A352759(n). A355751

Length of period of the continued fraction expansion of sqrt(2ⁿ+1). A59926

Number of partitions p of n such that m(p) < m(c(p)), where m = maximal multiplicity of parts, and c = conjugate. A240726

G.f.: A(x,y) = ∑_n>=0 xⁿ * ((1+x)ⁿ + y)ⁿ, where A(0) = 0, as a triangle of coefficients T(n,k) of xⁿ*y^k in A(x,y) = ∑_n>=0 xⁿ * ∑_k=0..n T(n,k)*xⁿ*y^k, read by rows. A325580

Table read by rows: T(n,k) = number of k-sided polygons in a cross with width 3 and height n (see Comments in A331455 for definition) for k = 3,4,5. A330848

Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives k values. A53019

Numbers that look the same when printed upside down. A111156

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns of odd length (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121745