Properties of the Number 25512

Twenty-Five Thousand Five Hundred Twelve

Basics

Value: 25511 → 25512 → 25513

Parity: even

Prime: No

Previous Prime: 25471

Next Prime: 25523

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 1063

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 1063, 2126

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001110101000

Octal: 61650

Duodecimal: 12920

Hexadecimal: 63a8

Square: 650862144

Square Root: 159.72476326481126

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

G.f. A(x) satisfies A(x) = 1 + x·A(x)/(1 - x·A(x)²). A106228

T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum. A247927

T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors or the same number of counterclockwise edge increases as its vertical neighbors. A205954

Number of finite sequences of integer partitions with total sum n and all distinct lengths. A358912

Shifts left when Euler transform applied 5 times. A144037

a(n) = 1728·n - 408. A157266

Integers n > 10563 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10563. A63064

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k triple descents (i.e., ddd's). A108443

Number of Motzkin n-paths avoiding odd-numbered steps that are up steps. A215067

a(n) = 4·A079137(n). A79312