Properties of the Number -15239

Fifteen Thousand Two Hundred Thirty-Nine

Basics

Value: -15240 → -15239 → -15238

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 ² × 311

Divisors: 1, 7, 49, 311, 2177, 15239

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11101110000111

Octal: -35607

Duodecimal: -899B

Hexadecimal: -3b87

Square: 232227121

Square Root: 123.44634461983878

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

Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity). A355732

T(n,k)=Number of length-n 0..k arrays with no repeated value unequal to the previous repeated value plus one mod k+1. A268944

G.f.: ∏_k>=1 1/(1-x^k)^2·k+3. A255802

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2. A214359

Number T(n,k) of inequivalent n X n matrices using exactly k different symbols, where equivalence means permutations of rows or columns or the symbol set; triangle T(n,k), n>=0, 0<=k<=n², read by rows. A242106

Numbers k such that A055079(k) = 2^k. A57838

Number of partitions p of n such that (maximal multiplicity over the parts of p) = (number of numbers in p having multiplicity > 1). A241132

Number of Baxter matrices of size 3 X n. A347673

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2. A214375

Number of compositions of n with exactly three occurrences of the largest part. A243738