Properties of the Number 26289

Twenty-Six Thousand Two Hundred Eighty-Nine

Basics

Value: 26288 → 26289 → 26290

Parity: odd

Prime: No

Previous Prime: 26267

Next Prime: 26293

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 23 × 127

Divisors: 1, 3, 9, 23, 69, 127, 207, 381, 1143, 2921

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011010110001

Octal: 63261

Duodecimal: 13269

Hexadecimal: 66b1

Square: 691111521

Square Root: 162.13882940245992

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) is the least positive integer such that nextprime(a(n)ⁿ) - prevprime(a(n)ⁿ) = 4. A90125

Number of all possible tetrahedra of any size and orientation, formed when intersecting the original regular tetrahedron by planes parallel to its sides and dividing its edges into n equal parts. A216173

Pair the odd numbers such that the k-th pair is (r, r+2k) where r is the smallest odd number not included earlier: (1, 3), (5, 9), (7, 13), (11, 19), (15, 25), (17, 29), (21, 35), (23, 39), (27, 45), ... This is the sequence of the product of the members of pairs. A75320

Positions of squares in A276573. A277014

Number of compositions (ordered partitions) of n into distinct parts where no part is a multiple of 5. A332311

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + 2·b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A294559

Number of n X 2 binary arrays with each 1 adjacent to exactly one 0 vertically and one 0 horizontally. A183344

a(n) = (9·n³ + 5·n)/2. A230018

G.f. A(x) satisfies: [xⁿ] (1+x)^n*(n-1) / A(x) = 0 for n>0. A304189

a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, s(1) = 1, s(n) = 3, |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also a(n) = T(n,n-3), where T is the array in A026268. A26289