Properties of the Number -15789

Fifteen Thousand Seven Hundred Eighty-Nine

Basics

Value: -15790 → -15789 → -15788

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 19 × 277

Divisors: 1, 3, 19, 57, 277, 831, 5263, 15789

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11110110101101

Octal: -36655

Duodecimal: -9179

Hexadecimal: -3dad

Square: 249292521

Square Root: 125.65428763078481

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

O.g.f.: ∑_n>=0 n! * nⁿ * xⁿ / ∏_k=1..n (1 - n²*k·x). A229259

Largest number not the sum of distinct n-th-order polygonal numbers. A7419

Numbers n such that 8·10ⁿ-7 is prime. A99190

Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {p(i)-i, i=1,2,...,n} has exactly k elements (1<=k<=n). A125182

Expansion of ∏_k>=1 1/(1 - k·x^k²). A285245

a(n) = floor(a(n-1)*(π-1)); a(1) = 1. A63457

"DGK" (bracelet, element, unlabeled) transform of 2,2,2,2,... A32231

A version of F. K. Hwang's sequence in {3·k, 3·k+1, 3·k+2}. A123945

Number of nX5 binary arrays with each 1 adjacent to exactly one 0 vertically and one 0 horizontally. A183347

Number of nX8 binary arrays with each 1 adjacent to exactly one 0 vertically and one 0 horizontally. A183350