Properties of the Number -12208

Twelve Thousand Two Hundred Eight

Basics

Value: -12209 → -12208 → -12207

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 7 × 109

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 56, 109

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111110110000

Octal: -27660

Duodecimal: -7094

Hexadecimal: -2fb0

Square: 149035264

Square Root: 110.48981853546506

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·a(n-1) + a(n-2) + a(n-3) with a(0)=a(1)=-1, a(2)=1. A215112

E.g.f. log(1+x)/cos(x). A9429

Expansion of tan(sin(x))*sinh(x)/2. A24246

Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments. A108914

T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A234882

Sum of all the parts in the partitions of n into 7 parts. A308926

a(n) = (-2 - (-1)ⁿ*(-2 + n) + n + 2·n³)/4. A323723

Number of simple graphs on n vertices rooted at one oriented edge. A304069

Number of ways to write n as an ordered sum of eight powers of 2. A342251

Number of partitions of n into 8 or more distinct parts. A347575