Properties of the Number 26299

Twenty-Six Thousand Two Hundred Ninety-Nine

Basics

Value: 26298 → 26299 → 26300

Parity: odd

Prime: No

Previous Prime: 26297

Next Prime: 26309

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 7 × 13 × 17 ²

Divisors: 1, 7, 13, 17, 91, 119, 221, 289, 1547, 2023

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011010111011

Octal: 63273

Duodecimal: 13277

Hexadecimal: 66bb

Square: 691637401

Square Root: 162.16966424088076

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

L.g.f.: ∑_n>=1 (xⁿ/n) * ∏_d∣n (1 + n·x^d/d). A205477

T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their king-move neighbors in a random 0..1 nXk array. A220977

a(n) = ∑_{1 <= x₁, x₂, x₃ <= n} ( gcd(x₁, n)/gcd(x₁, x₂, x₃, n) )². A371492

a(n+3) = 5·a(n+2) - 2·a(n+1) - 8·a(n), a(0) = 1, a(1) = 0, a(2) = 3. A110613

Number of equivalence classes of Dyck paths of semilength n for the consecutive pattern UDUDD, where U=(1,1) and D=(1,-1). A317639

Numbers k such that A372692(k) = A372692(k+1) > 1. A372693

Equals one maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to exactly one of their king-move neighbors in a random 0..1 nX3 array. A220972

A vector recursion sequence: k = 1; m = 2; l = 1; a(n)=k*{0,a(n-2),0}+m*{-(m-1)/m,a(n-1)}++m*{a(n-1),-(m-1)/m}+l*{0,0,a(n-4),0,0}. A152654

Equals one maps: number of nX7 binary arrays indicating the locations of corresponding elements equal to exactly one of their king-move neighbors in a random 0..1 nX7 array. A220976

Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1, |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also sum of numbers in row n+1 of the array T in A026268. A26299