Properties of the Number 26695

Twenty-Six Thousand Six Hundred Ninety-Five

Basics

Value: 26694 → 26695 → 26696

Parity: odd

Prime: No

Previous Prime: 26693

Next Prime: 26699

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 19 × 281

Divisors: 1, 5, 19, 95, 281, 1405, 5339, 26695

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100001000111

Octal: 64107

Duodecimal: 13547

Hexadecimal: 6847

Square: 712623025

Square Root: 163.38604591580028

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

T(n,k) is the number of non-equivalent distinguishing coloring partitions of the cycle on n vertices with exactly k parts. Regular triangle read by rows, n >= 1, 1 <= k <= n. A309784

Number of partitions of n in which each even part has odd multiplicity. A130126

Triangle T(n, k) = Numbers of inequivalent (mod D₃) ways to place k points on a triangular grid of side n so that no three of them are vertices of an equilateral triangle of any orientation. Triangle read by rows. A243141

Number T(n,k) of partitions of [n] having k blocks containing their own index when blocks are ordered with decreasing largest elements; triangle T(n,k), n>=0, 0<=k<=ceiling(n/2), read by rows. A350647

Numbers k such that k + sopfr(k) is a cube. A389862

Alternating sum of octagonal pyramidal numbers. A269429

G.f.: ∑_k>=0 x^k⁴ / ∏_j=1..k⁴ (1 - x^j). A339235

a(n) = prime(prime(n·n) - n·n) - n·n where prime(n) is the n-th prime. A141127

T(2n,n-2), T given by A026692. A26695