Properties of the Number 25341

Twenty-Five Thousand Three Hundred Forty-One

Basics

Value: 25340 → 25341 → 25342

Parity: odd

Prime: No

Previous Prime: 25339

Next Prime: 25343

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 8447

Divisors: 1, 3, 8447, 25341

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001011111101

Octal: 61375

Duodecimal: 127B9

Hexadecimal: 62fd

Square: 642166281

Square Root: 159.18856742869445

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 of directed column-convex polyominoes of height n: a(k+1)=(k+1)*a(k)+(a(1)+...+a(k)). A7808

Numbers which converge to 2592 under repeated application of the powertrain map of A133500. A135384

Number of polyhexes of class PF2 with a particular symmetry. A30525

Numbers with 5 distinct digits {1,2,3,4,5} such that all adjacent digits (as well as first and last digits) are coprime. A104972

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 98 ones. A31866

Number of 0..n arrays x(0..8) of 9 elements with zero 5th differences. A200332

Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the generalized pattern 23-1; triangle T(n,k), n>=0, 0<=k<=A125811(n)-1, read by rows. A260670

Number of permutations p of [n] such that the sequence of ascents and descents of p or of p0 (if n is even) forms a Dyck path. A303287

Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the consecutive step pattern up, down, up, down; triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-3)/2)), read by rows. A230797

Triangle read by rows: T(n,k) is the number of reverse alternating (i.e., up-down) permutations of {1,2,...,n} having k fixed points (n >= 0, 0 <= k <= 1 + floor(n/2)). A162980