Properties of the Number 86841

Eighty-Six Thousand Eight Hundred Forty-One

Basics

Value: 86840 → 86841 → 86842

Parity: odd

Prime: No

Previous Prime: 86837

Next Prime: 86843

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 9649

Divisors: 1, 3, 9, 9649, 28947, 86841

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101001100111001

Octal: 251471

Duodecimal: 42309

Hexadecimal: 15339

Square: 7541359281

Square Root: 294.6879705722648

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 even-length strict integer partitions of 2n+1. A343942

Coefficient array of numerator polynomials of o.g.f.s (rising powers) for the columns of triangle A008517 (second-order Eulerian numbers). A112692

Number of strict odd-length integer partitions of 2n + 1. A346634

Positions of 5-digit terms in the continued fraction for π (3 is position 0). A48961

a(n) = a((a(n-2))*mod(n,2)+a(n-1)*(1-mod(n,2))) + a((n - a(n-2))*mod(n,2)+(n-a(n-1))*(1-mod(n,2))). A86841

G.f. satisfies: A(x) = 1 + ∑_n>=1 x^n-1*series_reversion( x/A(x)ⁿ ). A125224

Number of (n+1)X4 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A203736

Number of (n+1)X(3+1) 0..3 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250702