Properties of the Number 32032

Thirty-Two Thousand Thirty-Two

Basics

Value: 32031 → 32032 → 32033

Parity: even

Prime: No

Previous Prime: 32029

Next Prime: 32051

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ⁵ × 7 × 11 × 13

Divisors: 1, 2, 4, 7, 8, 11, 13, 14, 16, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111110100100000

Octal: 76440

Duodecimal: 16654

Hexadecimal: 7d20

Square: 1026049024

Square Root: 178.97485856957675

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

Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions. A33282

Triangle obtained by adding a leading diagonal 1,0,0,0,... to A033282. A86810

Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1). A126216

Number T(n,k) of length 2n words such that all letters of the k-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A256117

T(n,k)=Number of length n+1 0..k arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero. A250167

a(n) = (9·n+10)*binomial(n+9,9)/10. A254142

Number of diagonal dissections of a convex n-gon into n-4 regions. A2055

The number of permutations having one non-overlapping occurrence of 122'1'. A177484

G.f.: 1/((1-x²)³*(1-x)⁴). A60099

Expansion of ∏_k>=1 ((1+x^k)/(1-x^k))^Fibonacci(k). A260916