Properties of the Number 26873

Twenty-Six Thousand Eight Hundred Seventy-Three

Basics

Value: 26872 → 26873 → 26874

Parity: odd

Prime: No

Previous Prime: 26863

Next Prime: 26879

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 7 × 11 × 349

Divisors: 1, 7, 11, 77, 349, 2443, 3839, 26873

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100011111001

Octal: 64371

Duodecimal: 13675

Hexadecimal: 68f9

Square: 722158129

Square Root: 163.92986305124518

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

Number of partitions of n into parts having at most two prime-factors. A101049

Number of subsets of {1..n} containing n such that every subset has a different sum. A325866

G.f. satisfies: A(x) = exp( ∑_n>=1 xⁿ/n * ∏_k>=1 1/(1 - x^n·k*A(xⁿ)^k) ). A219231

G.f.: ∏_k>=1 (1 + x^k³) / (1 - x^k). A280278

The reversing binary representation of the sum of the divisors of the n-th odd square: a(n) = A065621(A379223(n)). A379224

Odd composites (including 1 in the count) where the number 1 mod 4 equals the number 3 mod 4. A93180

Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-1,0,2}. A79987

Number of 3 X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal. A224134

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (1, -1, 1), (1, 0, 1), (1, 1, -1)}. A148909

E.g.f. satisfies: A'(x) = A(x)⁷ * A(-x)² with A(0) = 1. A236955