Properties of the Number -32206

Thirty-Two Thousand Two Hundred Six

Basics

Value: -32207 → -32206 → -32205

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 16103

Divisors: 1, 2, 16103, 32206

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111110111001110

Octal: -76716

Duodecimal: -1677A

Hexadecimal: -7dce

Square: 1037226436

Square Root: 179.46030201690846

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 nodes of even outdegree (including leaves) in all ordered trees with n edges. A26641

a(n) = A026637(n, floor(n/2)). A26643

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..3 introduced in row major order. A204642

Triangle T(n,k) read by rows, matrix product of A046899(row-reversed) * A130595. A158815

Expansion of 1/((1+x)*(1-x)¹⁰). A1781

A tree-node counting triangle. A109244

Number of symmetric Dyck paths of semilength n and having no hills (i.e., no peaks at level 1). A109078

Number left factors of Dyck paths of length n and having no hills; a hill is a (1,1)-step starting at level 0 and followed by a (1,-1)-step. A191526

Triangle T, read by rows : T(n,k) = A007318(n,k)*A026641(n-k). A171650

Number of (n+2)X4 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..3 introduced in row major order. A204636