Properties of the Number -25963

Twenty-Five Thousand Nine Hundred Sixty-Three

Basics

Value: -25964 → -25963 → -25962

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 7 × 3709

Divisors: 1, 7, 3709, 25963

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110010101101011

Octal: -62553

Duodecimal: -13037

Hexadecimal: -656b

Square: 674077369

Square Root: 161.13038198924497

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 integer partitions of n having a part that can be written as a nonnegative linear combination of the other (possibly equal) parts. A364913

On a spirally numbered square grid, with labels starting at 1, this is the number of the last cell that a (1,n) leaper reaches before getting trapped, or -1 if it never gets trapped. A323471

G.f. satisfies A(x) = 1/(1-x)² + x·A(x)³. A364620

Triangle T(n,k) = A008292(n+1,k+1) + A060187(n+1,k+1)- 1 read along rows 0<=k<=n. A176490

Triangle read by rows: T(m,n) is the label of the ending square of an (m,n)-leaper (a generalization of a chess knight) when it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square. A323750

Sum of the digits of 5^2ⁿ. A124307

Semiprimes of the form p² + pq + q², where p, q are consecutive primes. A243904

Numbers k such that k + φ(k) + φ(φ(k)) is a repdigit. A116027