Properties of the Number -23391

Twenty-Three Thousand Three Hundred Ninety-One

Basics

Value: -23392 → -23391 → -23390

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 23 × 113

Divisors: 1, 3, 9, 23, 69, 113, 207, 339, 1017, 2599

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -101101101011111

Octal: -55537

Duodecimal: -11653

Hexadecimal: -5b5f

Square: 547138881

Square Root: 152.9411651583706

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 n such that p(7n) is prime, where p(n) is the number of partitions of n. A114167

Number of proper diagonals of the n-dimensional associahedron (i.e., diagonals that are not included in lower dimension faces). A257887

Expansion of 1/(1 - ∑_k>=0 x^(2·k+1²)). A280863

a(n) = 289·n² - 2·n. A158252

The Wiener index of the Dutch windmill graph D(6,n) (n>=1). A180578

Triangle read by rows: T(n,k) is the number of planar tanglegrams of size n with 0 <= k < n leaf-matched pairs. A leaf matched pair is a pair of non-leaf vertices (u,v) in the tanglegram such that the induced subtrees rooted and u and v also form a tanglegram (equivalently, the leaves in these two subtrees are matched by the matching that forms the original tanglegram). A349409

Numbers that are the products of distinct substrings (>1) of themselves and do not end in 0. A59470

Zerofree numbers k such that the product (m+n)*p, where m,n are the first and the last digits of k, and p is the number which is the part of k between m and n, is a divisor of k. A320292

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes). A24603

Number of permutations of length n which avoid the patterns 1234, 2143, 3421. A116842