Properties of the Number -11869

Eleven Thousand Eight Hundred Sixty-Nine

Basics

Value: -11870 → -11869 → -11868

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 11 × 13 × 83

Divisors: 1, 11, 13, 83, 143, 913, 1079, 11869

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111001011101

Octal: -27135

Duodecimal: -6A51

Hexadecimal: -2e5d

Square: 140873161

Square Root: 108.94494022211403

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

Numbers k such that k divides sum of first k primes A007504(k). A45345

Number of integer partitions of n that are not pairwise coprime, where a singleton is not coprime unless it is (1). A335240

a(n) = n*(2·n² + 5·n + 1)/2. A162254

Column 1 of matrix square of triangle A152400; also, column 3 of square array A152405. A152404

Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms in row n at positions {m*(m+1)/2, m>=0} and then taking partial sums, starting with all 1's in row 0. A152405

a(n) = n*(6·n² - 8·n + 3). A272378

Expansion of 1/((1-2·x)*(1-6·x)*(1-7·x)). A16304

Maximum number of partitions of n into exactly k parts, each <= k. a(n) is maximum in each row of A157044. A157046

The number of primes of the form i² + j⁴ (A028916) <= 2ⁿ, counted with multiplicity. A226496

Difference between n-th prime squared and n-th perfect square. A106588