Properties of the Number -32088

Thirty-Two Thousand Eighty-Eight

Basics

Value: -32089 → -32088 → -32087

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 7 × 191

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111110101011000

Octal: -76530

Duodecimal: -166A0

Hexadecimal: -7d58

Square: 1029639744

Square Root: 179.13123680698462

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

Irregular triangle read by rows: numbers (2n-1)!*G(n,m) related to Galois polynomials. A280040

Triangle that arise in the study of Galois polynomials. A268482

Coordination sequence for (2,5,5) tiling of hyperbolic plane. A265064

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k hills (a hill is either a ud or a Udd starting at the x-axis). A108431

Number of distinct sums i³ + j³ + k³ + l³ for 0<=i<=j<=k<=l<=n. A374711

Susceptibility series H₆ for 2-dimensional Ising model (divided by 2). A55857

Triangle read by rows: T(n,k) is the number of partitions of a 3-colored set of n objects into at most k parts with 0 <= k <= n. A382045

Number of nXnXn triangular binary arrays with every 1 adjacent to at most 5 other 1s. A192414

Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 1 or less. A221597

Expansion of e.g.f. ∏_k>=1 (1 - log(1 - x)*x^k). A322613