Properties of the Number -3208

Two Hundred Eight

Basics

Value: -3209 → -3208 → -3207

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 401

Divisors: 1, 2, 4, 8, 401, 802, 1604, 3208

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110010001000

Octal: -6210

Duodecimal: -1A34

Hexadecimal: -c88

Square: 10291264

Square Root: 56.639209034025185

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 regions into which a figure made up of a row of n adjacent congruent rectangles is divided upon drawing diagonals of all possible rectangles (a(0)=0 by convention). A306302

G.f. A(x) satisfies: 1 = ∑_n=-oo..+oo (xⁿ - 2·x*A(x))ⁿ. A355868

Permutation rooted trees with n nodes. A50383

Table in which the g.f. of row n, R(n,x), satisfies ∑_k=-oo..+oo (x^k - n·R(n,x))^k = 1 - (n-2)*∑_k>=1 x^k², for n >= 1, as read by antidiagonals. A370030

Numbers of the form k + wt(k) for exactly three distinct k, where wt(k) = A000120(k) is the binary weight of k. A230092

a(1)=0; thereafter, a(n) is the smallest number such that the addition table for (a(1),...,a(n)) contains n*(n+1)/2 different entries, and the multiplication table for (a(2),...,a(n)) contains n*(n-1)/2 different nonzero entries (the maximum possible in both cases). A337656

Sophie Germain 4-almost primes. A111176

G.f. satisfies: A(x) = 1/(1 - x/A(-x·A(x)⁵)). A213226

Diagonal above central terms of pendular trinomial triangle A122445, ignoring leading zeros. A122450

Numbers n such that A062234(n) = A062234(n+1) = A062234(n+2). A258449