Properties of the Number -15055

Fifteen Thousand Fifty-Five

Basics

Value: -15056 → -15055 → -15054

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 3011

Divisors: 1, 5, 3011, 15055

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11101011001111

Octal: -35317

Duodecimal: -8867

Hexadecimal: -3acf

Square: 226653025

Square Root: 122.69881825021788

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

Total number of smallest parts in all partitions of n that do not contain 1 as a part. A195820

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock determinant equal to some horizontal or vertical neighbor 2X2 subblock determinant. A186218

Expansion of 1 / ((1-x)²*(1-x²)*(1-x³)*...*(1-x⁹)). A288344

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock determinant equal to exactly one or two horizontal and vertical neighbor 2X2 subblock determinants. A187425

Number of partitions of n containing m(1) as a part, where m denotes multiplicity. A240486

a(n) = ∑_{1 <= i < j <= n} j³*i³. A347107

Triangle, read by rows, with row n forming the coefficients in ∏_k=0..n (1 + k³*x). A249677

Triangle read by rows, Stirling cycle numbers of order 3, T(n,n) = 1, T(n,k) = 0 if k<0 or k>n, otherwise T(n,k) = T(n-1,k-1)+(n-1)³*T(n-1,k), for n>=0 and 0<=k<=n. A269947

Numerators of continued fraction convergents to sqrt(868). A42676

G.f. satisfies A(x) = 1/(1-x)³ + x²*A(x)³. A364626