Properties of the Number 85926

Eighty-Five Thousand Nine Hundred Twenty-Six

Basics

Value: 85925 → 85926 → 85927

Parity: even

Prime: No

Previous Prime: 85909

Next Prime: 85931

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 14321

Divisors: 1, 2, 3, 6, 14321, 28642, 42963, 85926

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100111110100110

Octal: 247646

Duodecimal: 41886

Hexadecimal: 14fa6

Square: 7383277476

Square Root: 293.1313698668227

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

Triangle read by rows: T(n,k) is the number of strongly connected oriented graphs on n unlabeled nodes with k arcs, n >= 1, k = 0..n*(n-1)/2. A350750

Coefficient of·in the reduction by x² -> x+1 of the polynomial p(n,x) defined at Comments. A192953

Least number·such that xⁿ has n digits equal to k. Case k = 3. A285450

Triangle, read by rows, T(n, k) = ∑_j=0..k (-1)^j*(k-j+1)ⁿ*binomial(n+1, j) *binomial(n+2, j)/(j+1). A176124

Triangle read by rows: first define the Narayana numbers: Y(n,m)=Binomial[n, m]*Binomial[n + 1, m + 1]/(n - m + 1); then t(n,m)=Sum[(-1)^j *Y(n + 1, j)*(k + 1 - j)ⁿ, {j, 0, k + 1}]. A155796

Number of nX5 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281762

a(n) = n if n is composite, else a(n) = smallest composite number beginning with n not obtained trivially by simply placing a zero as a least significant digit; i.e., a(n) is not equal to 10n. A85926