Properties of the Number 25724

Twenty-Five Thousand Seven Hundred Twenty-Four

Basics

Value: 25723 → 25724 → 25725

Parity: even

Prime: No

Previous Prime: 25717

Next Prime: 25733

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 59 × 109

Divisors: 1, 2, 4, 59, 109, 118, 218, 236, 436, 6431

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110010001111100

Octal: 62174

Duodecimal: 12A78

Hexadecimal: 647c

Square: 661724176

Square Root: 160.38703189472645

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

Fine's sequence (or Fine numbers): number of relations of valence >= 1 on an n-set; also number of ordered rooted trees with n nodes having root of even degree. A957

a(n) = (2·n-1)*(n² -n +2)/2. A63488

Triangle T(n,k) giving number of Dyck paths of length 2n with exactly k hills (0 <= k <= n). A65600

Generalized Catalan numbers C(-1; n). A64310

Expansion of 1/(1+x·c(x)), c(x) the g.f. of Catalan numbers A000108. A126983

Expansion of (1-2·x-sqrt(1-4·x))/(x² * (1+2·x+sqrt(1-4·x))). A104629

T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order. A222649

Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k. A65602

A bisection of A000957. A138413

Number of nX5 0..2 arrays with no more than floor(nX5/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..2 order. A222646