Properties of the Number -24906

Twenty-Four Thousand Nine Hundred Six

Basics

Value: -24907 → -24906 → -24905

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 593

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 593, 1186

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110000101001010

Octal: -60512

Duodecimal: -124B6

Hexadecimal: -614a

Square: 620308836

Square Root: 157.8163489629639

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) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n-k+1), where k = [ n/2 ], p = A000040, the primes. A25129

Numbers k such that the three second-degree cyclotomic polynomials x² + 1, x² - x + 1 and x² + x + 1 are simultaneously prime when evaluated at x=k. A87277

Number T(n,k) of partitions of [n] having exactly k blocks of maximal size; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A372722

E.g.f. satisfies log(A(x)) = (exp(x·A(x)) - 1)³ / 6. A357032

Number of partitions of n+9 with largest inscribed rectangle having area <= n. A218630

Coefficients of certain polynomials related to array A078740 ((3,2)-Stirling2). A91741

Similar to A137284, but considering Sum{ k = 1,2,3,... } 5^-nk. A136275

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 225", based on the 5-celled von Neumann neighborhood. A270944

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 246", based on the 5-celled von Neumann neighborhood. A271010

a(n) is the number of overpartitions of n where overlined parts are not divisible by 3 and non-overlined parts are congruent to 1 modulo 3. A335754