Properties of the Number 25638

Twenty-Five Thousand Six Hundred Thirty-Eight

Basics

Value: 25637 → 25638 → 25639

Parity: even

Prime: No

Previous Prime: 25633

Next Prime: 25639

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 4273

Divisors: 1, 2, 3, 6, 4273, 8546, 12819, 25638

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010000100110

Octal: 62046

Duodecimal: 12A06

Hexadecimal: 6426

Square: 657307044

Square Root: 160.11870596529315

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

Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1); triangle T(n,k), n>=0, read by rows. A243752

Position of first appearance of each integer in A088568 (number of 1's minus number of 2's in first n terms of A000002). A288605

Triangle T(n, k) = Numbers of non-equivalent (mod D₃) ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows. A239572

Least k such that the first k terms of the Kolakoski sequence (A000002) contain n more 2's than 1's. A25503

Number of connected subsets of n edges of the rhombic dodecahedron up to the 48 rotations and reflections of the rhombic dodecahedron. A383981

Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k UDUU's, 0 <= k <= floor((n-1)/2). A116424

Number of Dyck paths of semilength n having exactly one occurrence of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1). A243770

a(n) = index where A088568 (or equally A294448) first reaches or exceeds n in magnitude. A294449

Expansion of 1/sqrt(1 - 4·x - 8·x³). A374598

Number of (n+1) X 5 binary arrays with consecutive windows of two bits considered as a binary number nondecreasing in every row and column. A202331