Properties of the Number -11879

Eleven Thousand Eight Hundred Seventy-Nine

Basics

Value: -11880 → -11879 → -11878

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 7 × 1697

Divisors: 1, 7, 1697, 11879

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111001100111

Octal: -27147

Duodecimal: -6A5B

Hexadecimal: -2e67

Square: 141110641

Square Root: 108.99082530194916

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

a(n) = prime(n)² - 2. A49001

T(n,k)=Number of nXk 1..2 arrays with every element value z a city block distance of exactly z from another element value z. A209610

Frobenius number of the numerical semigroup generated by consecutive squares. A69756

a(n) = prime(n)*prime(n+1) + prime(n) + prime(n+1). A126199

a(n) = ∑_{k=0..floor(n/2)} binomial(k+3,3) * binomial(2·k,2·n-4·k). A382495

a(n) = 6·n*(n-1) - 1. A103115

Partials sums of A001694. A174172

The least number having n representations as p·q - p - q for primes p <= q. A218862

Odd composite numbers n, such that n, n+d, n·d and n/d are all odious (A000069) for every divisor d of n. A231558

(2^p-1 modulo p²) + (3^p-1 modulo p²), where p = prime(n). A240987