Properties of the Number -25366

Twenty-Five Thousand Three Hundred Sixty-Six

Basics

Value: -25367 → -25366 → -25365

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 11 × 1153

Divisors: 1, 2, 11, 22, 1153, 2306, 12683, 25366

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110001100010110

Octal: -61426

Duodecimal: -1281A

Hexadecimal: -6316

Square: 643433956

Square Root: 159.26707129849535

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

a(n) = C(3,n) δ C(0,n). A147724

a(n) = number of types of conjugacy classes in GL(n,q) (this is independent of q). A3606

Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any element within a city block distance of two, and containing the value n(n+1)/2-2. A212039

E.g.f.: ∑_n>=0 (exp((n+1)*x) - 1)ⁿ. A248798

Numbers k such that 7·10^k + 8·R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k. A103067

"CHJ" (necklace, identity, labeled) transform of 2,2,2,2... A32328

The number of permutations of length n sortable by 2 prefix block transpositions. A228394

Array read by downward antidiagonals: A(n,k) = ∑_i=0..n-1 ∑_j=0..k+1 binomial(n-1,i)*binomial(k+1,j)*A(i,j) with A(0,k) = 1, n >= 0, k >= 0. A383410