Properties of the Number 26785

Twenty-Six Thousand Seven Hundred Eighty-Five

Basics

Value: 26784 → 26785 → 26786

Parity: odd

Prime: No

Previous Prime: 26783

Next Prime: 26801

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 11 × 487

Divisors: 1, 5, 11, 55, 487, 2435, 5357, 26785

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100010100001

Octal: 64241

Duodecimal: 13601

Hexadecimal: 68a1

Square: 717436225

Square Root: 163.66123548354386

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) = a(n-1) + 2*(n-1)*a(n-2). A47974

Number T(n,k) of set partitions of [n] with minimal block length multiplicity equal to k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A271424

Square array A(n,k), n >= 0, k >= 1, read by antidiagonals downwards, where column k is the expansion of e.g.f. exp(∑_j=1..k x^j). A293669

Triangle read by rows: T(n,k) is the number of nilpotent subpermutations on an n-set, each of nilpotency index less than or equal to k. A261764

Exponential Riordan array (e^x(1+x),x). A122832

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * ∑_j=0..n binomial(k·j,n-j)/j!. A361277

a(n) = sum of terms in n-th row of A078448. A78449

Number of set partitions of [n] with minimal block length multiplicity equal to two. A271762

Decimal part of a(n)^1/3 starts with reversal of its integer part: first term of runs. A34309

a(n) = n*(n+1)*(5·n² - n - 3)/2. A172118