Properties of the Number 26141

Twenty-Six Thousand One Hundred Forty-One

Basics

Value: 26140 → 26141 → 26142

Parity: odd

Prime: Yes

Previous Prime: 26119

Next Prime: 26153

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 26141

Divisors: 1, 26141

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011000011101

Octal: 63035

Duodecimal: 13165

Hexadecimal: 661d

Square: 683351881

Square Root: 161.68178623456632

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 maximal primitive subsets of {1..n}. A326077

a(n) is the number of distinct volumes > 0 of tetrahedra with edges of integer length whose largest is n. A371345

a(n) = 6ⁿ-5ⁿ-4ⁿ-3ⁿ-2ⁿ-1. A147977

Hyperartiads. A270798

Primes of the form 6n² + 5. A201600

a(n) = p² - sum of digits of p^p, where p = prime(n). A140499

Primes whose reversal - 1 is a square. A167218

Square array read by antidiagonals downwards: A(n, k) = (∑_i=1..n i^k) - (n+1)^k for n >= 1, k >= 1. A290844

Square array T(n,k) = kⁿ - ∑_{0 < i < k} e(i)*(k-i)ⁿ where e(i) = 1 if the partial sum up to this term would remain <= kⁿ, or 0 else; n, k >= 1; read by falling antidiagonals. A332099

a(n) = nⁿ - (n-1)ⁿ - (n-2)ⁿ - ... - 1ⁿ. A341331