Properties of the Number 25362

Twenty-Five Thousand Three Hundred Sixty-Two

Basics

Value: 25361 → 25362 → 25363

Parity: even

Prime: No

Previous Prime: 25357

Next Prime: 25367

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 1409

Divisors: 1, 2, 3, 6, 9, 18, 1409, 2818, 4227, 8454

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110001100010010

Octal: 61422

Duodecimal: 12816

Hexadecimal: 6312

Square: 643231044

Square Root: 159.25451327984396

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 magic labelings of the cycle-of-loops graph LOOP X C₆ having magic sum n, where LOOP is the 1-vertex, 1-loop-edge graph. A244879

Triangle T(n,k) read by rows: the coefficient [x^k] of the ∏_s=1..n (x+64·cos(s*π/(2n+1))⁶), 0<=k<=n. A179838

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 318", based on the 5-celled von Neumann neighborhood. A271252

Triangle T(n, k) read by rows: T(0, 0) = 1 and T(n, k) = ∑_i=0..k-1 T(n, i) + ∑_i=k..n-1 T(n-1, i). A318301

Rectangular array read by antidiagonals: A(n,k) = number of magic labelings of the graph LOOP X C_n (see comments) having magic sum k, n >= 1, k >= 0. A293311

Numbers that are the sum of 4 nonzero squares in exactly 6 ways. A25362

Rectangular array read by antidiagonals: A(n,k) = tr((M_n)^k), k >= 0, where M_n is the n X n matrix M₁ = {{1}}, M_n = {{0,...,0,1},{0,...,0,1,1},...,{0,1,...,1},{1,...,1}}, n > 1, and tr(.) is the trace. A293312