Properties of the Number -12068

Twelve Thousand Sixty-Eight

Basics

Value: -12069 → -12068 → -12067

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 7 × 431

Divisors: 1, 2, 4, 7, 14, 28, 431, 862, 1724, 3017

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10111100100100

Octal: -27444

Duodecimal: -6B98

Hexadecimal: -2f24

Square: 145636624

Square Root: 109.85444915887567

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

Number of labeled n-vertex graphs without vertices of degree <=1. A100743

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero. A206010

T(n,k)=Number of nXk 0..3 arrays with rows and columns in nondecreasing order. A184129

Exponents k such that the sum of decimal digits of 2^k is also a power of 2. A95412

Triangle read by rows where T(n,k) is the number of labeled simple graphs covering n vertices with exactly k endpoints (vertices of degree 1). A327377

a(n+1) = ∑_{k=0..floor(2·n/5)} a(k) * a(n-k). A30037

Poincaré series [or Poincare series] (or Molien series) for a certain five-fold wreath product P₅. A91726

Number of graphs on n labeled nodes with degree at most 3. A136282

Number of ways to place 3 nonattacking knights on an n X n cylindrical board. A172965

a(n) = ∑_d∣n rad(d)^n/d, where rad(d) = A007947(d) is the squarefree kernel of d. A95001