Properties of the Number -23072

Twenty-Three Thousand Seventy-Two

Basics

Value: -23073 → -23072 → -23071

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁵ × 7 × 103

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101101000100000

Octal: -55040

Duodecimal: -11428

Hexadecimal: -5a20

Square: 532317184

Square Root: 151.8947003683802

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

E.g.f.: log(tanh(x)+cos(x))=x-2/2!*x²+3/3!*x³-12/4!*x⁴+65/5!*x⁵... A13152

Expansion of e.g.f. log(sech(x) + sin(x)). A13202

G.f.: A(x) = exp( ∑_n>=1 σ(n²)*xⁿ/n ), a power series in·with integer coefficients. A156303

T(n,k)=Number of nXk 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279580

Array read by antidiagonals: T(n,k) is the number of permutations of k indistinguishable copies of 1..n with exactly 2 local maxima. A334773

Principal diagonal of the convolution array A213828. A213829

The PDO_t(n) function (Number of tagged parts over all the partitions of n with designated summands in which all parts are odd). A293422

Number of 5 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally. A188556

E.g.f.: ∑_n>=0 2^-n*(n+1/2!) * ∏_k=0..n tan(2^k*x). A194456

Leading diagonal of triangle in A211321. A212198