Properties of the Number -11515

Eleven Thousand Five Hundred Fifteen

Basics

Value: -11516 → -11515 → -11514

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 7 ² × 47

Divisors: 1, 5, 7, 35, 47, 49, 235, 245, 329, 1645

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110011111011

Octal: -26373

Duodecimal: -67B7

Hexadecimal: -2cfb

Square: 132595225

Square Root: 107.30796801729124

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

Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] ∏_m=1..n (x - m - r), with r = 3. A49459

Numbers k such that k and k+1 have the same sum of unitary divisors (A034448). A64125

Numbers k such that bsigma(k) = bsigma(k+1), where bsigma(k) is the sum of the bi-unitary divisors of k (A188999). A293183

Numbers k such that isigma(k) = isigma(k+1), where isigma(k) is the sum of the infinitary divisors of k (A049417). A306985

Numbers using only digits 1 and 5. A276037

a(n) = 2·Farey(m; I) - 1 where m = Fibonacci (n + 1) and I = [1/n, 1]. A176502

T(n,k) is the number of non-equivalent distinguishing coloring partitions of the cycle on n vertices with exactly k parts. Regular triangle read by rows, n >= 1, 1 <= k <= n. A309784

Integers that need 10 iterations of the map x->A352172(x) to reach 1. A352268

Composite numbers k such that A075255(k) is a square. A386245

Generalized Stirling numbers, [n+8,8]_4. A1719