Properties of the Number -24931

Twenty-Four Thousand Nine Hundred Thirty-One

Basics

Value: -24932 → -24931 → -24930

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 107 × 233

Divisors: 1, 107, 233, 24931

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -110000101100011

Octal: -60543

Duodecimal: -12517

Hexadecimal: -6163

Square: 621554761

Square Root: 157.8955350857015

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 A353802(k) / σ(σ(k)) is an integer > 1, where A353802(n) = ∏_p^e||n σ(σ(p^e)). A353807

Expansion of 1/((1+x)*(sqrt(1-4·x²)-x)). A116391

Numbers k such that there is no prime p and index j < k such that A002182(k) = p·A002182(j). A272606

Odd integers k such that for every m >= 1 the numbers k·4^m - 1 have at least three prime factors, not necessarily distinct, and k·4^m - 1 has at least two-element covering set. A233552

Number of (4+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7. A252388

Smallest semiprime p1·p2 such that p2 mod p1 = n and no prime is used more than once in the sequence. A386256

Number of minimal dominating sets in the n-dipyramidal graph (for n > 3). A347638