Properties of the Number 25340

Twenty-Five Thousand Three Hundred Forty

Basics

Value: 25339 → 25340 → 25341

Parity: even

Prime: No

Previous Prime: 25339

Next Prime: 25343

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 × 7 × 181

Divisors: 1, 2, 4, 5, 7, 10, 14, 20, 28, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110001011111100

Octal: 61374

Duodecimal: 127B8

Hexadecimal: 62fc

Square: 642115600

Square Root: 159.18542646863122

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..2 arrays with every 2X2 subblock having nonzero determinant and having the same number of clockwise edge increases as its horizontal and vertical neighbors. A206128

Number of compositions of n, where the difference between the number of odd parts and the number of even parts is 10. A242508

Lower (1/2)-midsequence of Fibonacci numbers (A000045) and tribonacci numbers (A000213); see Comments. A390348

Upper (1/2)-midsequence of Fibonacci numbers (A000045) and tribonacci numbers (A000213); see Comments. A390349

Number of (n+1)X4 0..2 arrays with every 2X2 subblock having nonzero determinant and having the same number of clockwise edge increases as its horizontal and vertical neighbors. A206123

Number of (n+1) X (4+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A235285

G.f. A(x) satisfies: A(x) = A(x³) / (1 - x - x²). A393315

Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having nonzero determinant and having the same number of clockwise edge increases as its horizontal and vertical neighbors. A206120

Triangle read by rows: T(n, k) = ∑_t=k..n-2 (-1)^t-k*(n-t)!*binomial(t,k)*binomial(n-2,t). A264027

T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A235289