Properties of the Number 26145

Twenty-Six Thousand One Hundred Forty-Five

Basics

Value: 26144 → 26145 → 26146

Parity: odd

Prime: No

Previous Prime: 26141

Next Prime: 26153

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 7 × 83

Divisors: 1, 3, 5, 7, 9, 15, 21, 35, 45, 63

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011000100001

Octal: 63041

Duodecimal: 13169

Hexadecimal: 6621

Square: 683561025

Square Root: 161.69415573854238

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

Odd primitive abundant numbers. A6038

Numbers k such that the digits of σ(k) are a permutation of those of k, in base 10. A115920

Triangle read by rows: T(n,k) is the number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2 or 3 (n >= 0, 0 <= k <= 3n). A144385

T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..2 nXk array. A219106

Odd admirable numbers: such that σ(n) = 2n + 2d for some d | n. A109729

Triangle read by rows: a(n,k) = number of partitions of an n-set into exactly k nonempty subsets, each of size <= 3. A111246

Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors. A188439

Numbers n=2·k-1 where ∑_j=1..k (-1)^j+1 * d(2·j-1) achieves a new record, with d(n) = number of divisors of n (A000005). A318737

Odd recursive abundant numbers: odd numbers k such that A333926(k) > 2·k. A333950

Odd numbers k that are closer to being perfect than previous terms and also satisfy the conditions that σ(k) preserves the 3-adic valuation of k, and that σ(k) == -k (mod 3). A386420