Properties of the Number -23649

Twenty-Three Thousand Six Hundred Forty-Nine

Basics

Value: -23650 → -23649 → -23648

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7883

Divisors: 1, 3, 7883, 23649

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101110001100001

Octal: -56141

Duodecimal: -11829

Hexadecimal: -5c61

Square: 559275201

Square Root: 153.78231367748373

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

T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 010 in rows and columns. A202616

Number of unlabeled hypertrees with up to n vertices and without singleton edges. A304970

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n k^j * binomial(n,j) * binomial(2·j,j). A340970

a(n) = ∑_k=0..n n^k * binomial(n,k) * binomial(2·k,k). A340971

Numbers n such that φ(reverse(n)) = σ(n). A70835

Expansion of ∏_k>=1 1/((1 - x^k)*(1 - x^4·k)). A318027

Triangle T(n, k) = (-1)^n-k*StirlingS1(n, k) + (-1)^k*StirlingS1(n, n-k) + (-1)ⁿ*StirlingS1(n, k)*StirlingS1(n, n-k), read by rows. A155744

Number of (n+2)X4 binary arrays avoiding patterns 001 and 010 in rows and columns. A202610

Number of (n+2)X6 binary arrays avoiding patterns 001 and 010 in rows and columns. A202612