Properties of the Number -3232

Two Hundred Thirty-Two

Basics

Value: -3233 → -3232 → -3231

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ⁵ × 101

Divisors: 1, 2, 4, 8, 16, 32, 101, 202, 404, 808

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110010100000

Octal: -6240

Duodecimal: -1A54

Hexadecimal: -ca0

Square: 10445824

Square Root: 56.85068161420758

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 twos minus number of ones in the first 2ⁿ entries of the Kolakoski sequence, A000002. A289323

Expansion of ∏_k>=1 (1 - x^k)^k*(k+1/2). A292386

Expansion of 1/(1-2·x+2·x²+2·x³). A77945

Doublets: base-10 representation is the juxtaposition of two identical strings. A20338

Number of subsets of integers 1 through n (including the empty set) containing no pair of integers that share a common factor. A84422

Numbers using only digits 2 and 3. A32810

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or antidiagonally, with no adjacent elements equal. A232589

Product of the 5th power of a prime (A050997) and a different prime (p⁵*q). A178740

Number of compositions (ordered partitions) of n into distinct and relatively prime parts. A332004

T(n,k) = Number of n X k 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element. A283572