Properties of the Number -25593

Twenty-Five Thousand Five Hundred Ninety-Three

Basics

Value: -25594 → -25593 → -25592

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 19 × 449

Divisors: 1, 3, 19, 57, 449, 1347, 8531, 25593

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110001111111001

Octal: -61771

Duodecimal: -12989

Hexadecimal: -63f9

Square: 655001649

Square Root: 159.9781235044342

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 unlabeled rooted semi-identity trees with n nodes. A306200

Numbers k such that 141·2^k+1 is prime. A32420

Least integers that satisfy ∑_n>=1 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*π/2. A84814

Odd composite integers m such that U(m)² == 1 (mod m) and V(m) == 6 (mod m), where U(m) and V(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=6 and b=-1, respectively. A337629

Numbers k such that k² + 1 == 0 (mod 41²). A157116

Odd composite integers m such that A085447(m) == 6 (mod m). A338078

Number of partitions of n in which exactly one odd part is repeated and even parts are unrestricted. A353903

a(n) = ∑_k=0..n-2 A205497(n, k) * (1 - k mod 2) if n >= 2, a(0) = a(1) = 1. A373752

a(n) = ∑_{k=0..floor(n/2)} binomial(n-2·k,floor(k/3)). A376695