Properties of the Number -1968

Nine Hundred Sixty-Eight

Basics

Value: -1969 → -1968 → -1967

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 41

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 41

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11110110000

Octal: -3660

Duodecimal: -1180

Hexadecimal: -7b0

Square: 3873024

Square Root: 44.36214602563767

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

Expansion of (η(q)*η(q³))/η(q²)² in powers of q. A293306

Expansion of e.g.f. 1/(1 - x·exp(-x·exp(-x))). A362273

Triangle by rows with row n formed by coefficients of the characteristic polynomial of the n X n tridiagonal matrix with m_i,i = 2 for i=1..n, m_i,i-1 = m_i,i+1 = -1 for i=2..n-1, and m_1,2 = m_n,n-1 = -2. A140882

Coefficients in the power series expansion of A(x) = ∑_n=-oo..+oo n·x^2·n+2 * (1 - xⁿ)ⁿ⁺¹. A357406

Expansion of x*(-1+5·x-6·x²+x³) / ( (2·x-1)*(x³-3·x²+1) ). A122167

A triangle sequence from matrix polynomials of a three symbol type {0, 1, -1}: c(i,k)= Floor[Mod[i/2^k, 2]]; M(d)=Table[If[Sum[c(n, k)*c(m, k), {k, 0, d - 1}] == 0, 1, If[Sum[c(n, k)*c(m, k), {k, 0, d - 1}] == 1, -1, 0]], {n, 0, d - 1}, {m, 0, d - 1}]. A158417

Calendar Problem #27, April 2012 Mathematics Teacher. A208646

Number of 2's in all partitions of n. A24786

Number of maximal subsets of {1..n} such that it is possible to choose a different prime factor of each element. A370585

Numbers that can be expressed as the difference of the squares of primes in just one distinct way. A90781