Properties of the Number -5516

Five Hundred Sixteen

Basics

Value: -5517 → -5516 → -5515

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 7 × 197

Divisors: 1, 2, 4, 7, 14, 28, 197, 394, 788, 1379

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010110001100

Octal: -12614

Duodecimal: -3238

Hexadecimal: -158c

Square: 30426256

Square Root: 74.26977851050857

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

Triangle of numerators of coefficients of the polynomial Q_m(n) defined by the recursion Q₀(n)=1; for m >= 1, Q_m(n) = ∑_i=1..n i·Q_m-1(i). For m >= 1, the denominator for all 2·m+1 terms of the m-th row is A053657(m+1). A202339

Number of integer partitions of n of which every permutation has a consecutive monotone triple, i.e., a triple (..., x, y, z, ...) such that either x <= y <= z or x >= y >= z. A344654

Numbers n such that Bernoulli number B_n has denominator 870. A272185

Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's into distinct multisets; square array A(n,k), n>=0, k>=0, read by antidiagonals. A346520

Numbers m such that there are precisely 16 groups of order m. A295161

Minimal number of people to give a 50% probability of having at least n coincident birthdays in one year. A14088

Numbers k such that k³ divides 15^k² - 1. A177915

Number of (directed) Hamiltonian paths in the n-ladder graph. A137882

Number T(n,k) of endofunctions on [n] such that at least one preimage with cardinality k exists and, if j is the largest value with a nonempty preimage, the preimage cardinality of i is >=k for all i<=j and equal to k for at least one i<=j; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A245733

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly one way, and new values 0..1 introduced in row major order. A204361