Properties of the Number -19307

Nineteen Thousand Three Hundred Seven

Basics

Value: -19308 → -19307 → -19306

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 43 × 449

Divisors: 1, 43, 449, 19307

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100101101101011

Octal: -45553

Duodecimal: -B20B

Hexadecimal: -4b6b

Square: 372760249

Square Root: 138.94963116179906

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 of n-1 boys and one girl with no couple. A120452

Positive integers m such that π(m²) = π(j²) + π(k²) for no 0 < j <= k < m. A262408

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nXk array. A219217

Number of binary [ n,4 ] codes without 0 columns. A34345

Numbers k such that k⁸ starts with k itself (in base 10). A233454

Diagonal sums of number array A082046. A82047

MM-numbers of crossing set partitions. A324324

Odd composite integers m such that A054413(m-J(m,53)) == 0 (mod m), where J(m,53) is the Jacobi symbol. A340096

a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=3. A22308

Poincaré series [or Poincare series] (or Molien series) for a certain six-fold wreath product P₆. A91769