Properties of the Number 26689

Twenty-Six Thousand Six Hundred Eighty-Nine

Basics

Value: 26688 → 26689 → 26690

Parity: odd

Prime: No

Previous Prime: 26687

Next Prime: 26693

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 13 × 2053

Divisors: 1, 13, 2053, 26689

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100001000001

Octal: 64101

Duodecimal: 13541

Hexadecimal: 6841

Square: 712302721

Square Root: 163.36768346279504

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 subsets of {1..n} containing all of their integer quotients. A326023

Coefficients of 1/(1-2·x-7·x²)^1/2; also, a(n) is the central coefficient of (1+x+2·x²)ⁿ. A84601

Number triangle T(n,k) = ∑_j=0..n C(n-k,j-k)*C(j,n-j)*2^n-j. A115991

Number of integers in n-th generation of tree T(-3/2) defined in Comments. A274154

a(n) = A115004(2n)/4. A331760

CATS sequence: cube-add-then-sort variation of RATS (reverse, add then sort) sequence. A79320

Number of nX3 0..1 arrays with every element unequal to 0, 1, 3, 6 or 8 king-move adjacent elements, with upper left element zero. A305477

Number of sequences with n copies each of 1, 2, 3 and longest increasing subsequence of length 3. A47911

a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026681. A26689