Properties of the Number 26109

Twenty-Six Thousand One Hundred Nine

Basics

Value: 26108 → 26109 → 26110

Parity: odd

Prime: No

Previous Prime: 26107

Next Prime: 26111

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 967

Divisors: 1, 3, 9, 27, 967, 2901, 8703, 26109

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010111111101

Octal: 62775

Duodecimal: 13139

Hexadecimal: 65fd

Square: 681679881

Square Root: 161.58279611394278

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

Numbers k such that 7·2^k - 1 is prime. A1771

Starting numbers for which the RATS sequence has eventual period 3. A114613

E.g.f.: (cosh(3·x) + sinh(3·x)*cosh(x)) / sqrt(1 - sinh(x)²*sinh(3·x)²). A245154

Pisot sequence E(14,23), a(n) = floor( a(n-1)²/a(n-2)+1/2 ). A10902

Number of walks within N² (the first quadrant of Z²) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 1), (0, -1), (0, 1), (1, -1), (1, 1)}. A151459

Number of pairs of terms of the sequence A228126 less than 10ⁿ. A239290

Square table T, read by antidiagonals, where T(n,k) gives the number of n-th generation descendents of a node labeled (k) in the tree of 5-tournament sequences. A113103

E.g.f.: (cosh(3·x) + sinh(3·x)*cosh(x)) / (cosh(x) - sinh(x)*cosh(3·x)). A245155

Number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having no pyramids (a pyramid is a sequence u^pd^p or U^pd^2p for some positive integer p, starting at the x-axis). A108449

a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1, s(n) = 3, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-3), where T is the array defined in A026105. A26109