Properties of the Number -11968

Eleven Thousand Nine Hundred Sixty-Eight

Basics

Value: -11969 → -11968 → -11967

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁶ × 11 × 17

Divisors: 1, 2, 4, 8, 11, 16, 17, 22, 32, 34

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10111011000000

Octal: -27300

Duodecimal: -6B14

Hexadecimal: -2ec0

Square: 143233024

Square Root: 109.39835464941875

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) = 2·binomial(n,3). A7290

Number of 2-edge-connected labeled graphs on n nodes. A95983

Triangle read by rows: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, n>=0, fibonacci(n+2)<=k<=2ⁿ. A143897

Products of the 6th power of a prime and 2 distinct primes (p⁶*q·r). A179672

Triangle read by columns: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, k>=1, A029837(k)<=n<A072649(k). A217298

Expansion of ∏_k>=1 1/(1-x^3·k-2)^3·k-2. A262947

Number of 3 X 3 magic squares (with distinct positive entries) having all entries < n. A108576

Triangle T(n, k, m) = coefficients of p(x, n, m) where p(x,n,m) = (x+1)*p(x, n-1, m) + 2^m+n-1 *x·p(x, n-2, m) and m=0, read by rows. A154982

Triangle read by rows where T(n,k) is the number of labeled simple connected graphs with n vertices and exactly k bridges. A327072

Quotient obtained when A036284(n) is considered as a GF(2)[X]-polynomial and it is divided by (x³ + 1) ^ A000225(n-1). A136380