Properties of the Number -23938

Twenty-Three Thousand Nine Hundred Thirty-Eight

Basics

Value: -23939 → -23938 → -23937

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 11969

Divisors: 1, 2, 11969, 23938

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101110110000010

Octal: -56602

Duodecimal: -11A2A

Hexadecimal: -5d82

Square: 573027844

Square Root: 154.719100307622

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 partitions p of n such that the number of numbers having multiplicity 1 in p is not a part and the number of numbers having multiplicity > 1 is a part. A241415

Number of partitions of n where the minimal multiplicity of any part is 2. A244515

Number of partitions of (3, n) into a sum of distinct pairs. A268346

Average of Eulerian numbers (A008292) and Pascal's triangle (A007318): t(n,m) = (A008292(n,m) + A007318(n,m))/2. A141689

Coordination sequence for MgNi2, Position Mg1. A9936

From George Gilbert's marks problem: jumping 4 marks at a time (final positions). A19596

Decimal part of a(n)^1/3 starts with reversal of its integer part: first term of runs. A34309

Numbers k such that 6·10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k. A56717

Triangular sequence defined by T(n, m) = Coefficients(q(x,n) + x^n-2*q(1/x,n))/4, where q(x, n) = d²*P(x, n)/dx² and p(x, n)=(x-1)ⁿ⁺¹*∑_k>=0 ((-1)^{n + 1}*kⁿ)*x^k-1. A154702