Properties of the Number 25226

Twenty-Five Thousand Two Hundred Twenty-Six

Basics

Value: 25225 → 25226 → 25227

Parity: even

Prime: No

Previous Prime: 25219

Next Prime: 25229

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 12613

Divisors: 1, 2, 12613, 25226

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001010001010

Octal: 61212

Duodecimal: 12722

Hexadecimal: 628a

Square: 636351076

Square Root: 158.826949854236

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 arrays containing k copies of 0..n-1 avoiding the pattern down-up in every row and column. A269505

Numbers n such that 1 + Sum{k=1..n/2} A001223(2k-1)*(-1)^k = 0. A130642

Expansion of 1/(x⁵ - 2·x⁴ + x³ - 2·x² + x - 1). A129704

Numbers n such that 1 - S(n) = 0, where S(n) = (S(n-1) + A000040(n))*(-1)ⁿ; S(0)=0, n=>1. A131197

Number of 3Xn arrays containing n copies of 0..3-1 avoiding the pattern down-up in every row and column. A269507

Number of 3 X n 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A281717

Number of nX6 0..1 arrays with every element unequal to 0, 1, 2, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A306164

Number of nXn 0..1 arrays with every element unequal to 0, 1, 2, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A306160

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A306166

a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 2. Also a(n) = 3ⁿ*C(n-1), where C = A000108 (Catalan numbers). A25226