Properties of the Number 26050

Twenty-Six Thousand Fifty

Basics

Value: 26049 → 26050 → 26051

Parity: even

Prime: No

Previous Prime: 26041

Next Prime: 26053

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 ² × 521

Divisors: 1, 2, 5, 10, 25, 50, 521, 1042, 2605, 5210

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010111000010

Octal: 62702

Duodecimal: 130AA

Hexadecimal: 65c2

Square: 678602500

Square Root: 161.40012391568973

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)=Number of nXk 0..1 arrays with row sums nondecreasing and column sums unimodal. A223625

a(n) = 25·n² - 36·n + 13. A154355

a(n) = (n³ - 2·n² + 3·n + 2)/2. A189890

Coefficient of·in the reduction by x²->x+1 of the polynomial p(n,x) defined below in Comments. A192761

a(n) = (5·n + 1)² + 4·n + 1. A7533

Numbers m such that m²+1 is prime with (m-1)²+1 and (m+1)²+1 semiprimes. A321795

Number of nX3 0..1 arrays with row sums nondecreasing and column sums unimodal. A223621

Alternating sum of heptagonal pyramidal numbers. A269428

a(n) = start of a sequence of at least n consecutive primes, p₁, p₂, ..., p_n (say), all == 1 mod 4, such that A(p₁) > A(p₂) > ... > A(p_n), where A(p) (see A145010) is the area of the Pythagorean triangle with hypotenuse p. A144954

A symmetrical triangle: T(n,k) = binomial(n, k)*if(floor(n/2) greater than or equal to k then 4^k, otherwise 4^n-k). A174301