Properties of the Number 26085

Twenty-Six Thousand Eighty-Five

Basics

Value: 26084 → 26085 → 26086

Parity: odd

Prime: No

Previous Prime: 26083

Next Prime: 26099

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 37 × 47

Divisors: 1, 3, 5, 15, 37, 47, 111, 141, 185, 235

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010111100101

Octal: 62745

Duodecimal: 13119

Hexadecimal: 65e5

Square: 680427225

Square Root: 161.5085137074823

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

Expansion of 1/(1 - x² - x⁷ - x¹² + x¹⁴) (a Salem polynomial). A143619

Number of plane partitions of n with at most two rows. A990

Numbers that are divisible by the product of their factorial base digits (A208575). A286590

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) = 3, b(0) = 2, b(1) = 4. A294418

Number of distinct determinants of 3 X 3 matrices with entries from {0, 1, ..., n}. A366158

Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k isolated strongly connected components, n>=0, 0<=k<=n. A362226

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