Properties of the Number 25138

Twenty-Five Thousand One Hundred Thirty-Eight

Basics

Value: 25137 → 25138 → 25139

Parity: even

Prime: No

Previous Prime: 25127

Next Prime: 25147

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 12569

Divisors: 1, 2, 12569, 25138

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001000110010

Octal: 61062

Duodecimal: 1266A

Hexadecimal: 6232

Square: 631919044

Square Root: 158.54967675779096

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 (n+1) X (k+1) 0..3 arrays x(i,j) with every row sum{j·x(i,j), j=1..k+1} equal, and every column sum{i·x(i,j), i=1..n+1} equal, with top left element <= 1. A232526

Series expansion for mean-squared radius of gyration of directed and convex polygons on square lattice. A121778

Number of length n+7+1 0..7 arrays with every value 0..7 appearing at least once in every consecutive 7+2 elements, and new values 0..7 introduced in order. A242238

Triangle of coefficients T(n,k) in g.f. A(x,y) satisfying ∑_n=-oo..+oo (xⁿ - y·A(x,y))ⁿ = 1 - (y-2)*∑_n>=1 x^n², for n >= 1, as read by rows. A370041

T(n,k)=Number of length n+k+1 0..k arrays with every value 0..k appearing at least once in every consecutive k+2 elements, and new values 0..k introduced in order. A242239

Number of tilings of an n X 9 rectangle using integer-sided rectangular tiles of area n. A220134

a(n) = (1/2)*(3rd elementary symmetric function of C(n,0), C(n,1), ..., C(n,[ n/2 ])). A25138