Properties of the Number -25663

Twenty-Five Thousand Six Hundred Sixty-Three

Basics

Value: -25664 → -25663 → -25662

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 2333

Divisors: 1, 11, 2333, 25663

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110010000111111

Octal: -62077

Duodecimal: -12A27

Hexadecimal: -643f

Square: 658589569

Square Root: 160.1967540245432

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

Numbers k such that 5 is the smallest decimal digit of k². A291630

T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical, diagonal and antidiagonal neighbors exactly one smaller than itself. A266067

Limiting values of A136406: a(n) = A136406(m,m-n) for any m >= 2n. A137504

G.f. A(x,y) satisfies: A(x,y) = x + A( x² + x·y*A(x,y)², y). A271868

Number of zero-sum -n..n arrays of 4 elements with first through third differences also in -n..n. A202512

Number of nX4 integer arrays with each element equal to the number of horizontal, vertical, diagonal and antidiagonal neighbors exactly one smaller than itself. A266064

Number of ways to partition a 4·n X 3 grid into 4 connected equal-area regions. A167244

Number of nX6 integer arrays with each element equal to the number of horizontal, vertical, diagonal and antidiagonal neighbors exactly one smaller than itself. A266066