Properties of the Number 32212

Thirty-Two Thousand Two Hundred Twelve

Basics

Value: 32211 → 32212 → 32213

Parity: even

Prime: No

Previous Prime: 32203

Next Prime: 32213

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 8053

Divisors: 1, 2, 4, 8053, 16106, 32212

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110111010100

Octal: 76724

Duodecimal: 16784

Hexadecimal: 7dd4

Square: 1037612944

Square Root: 179.47701802737865

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

Consider all integer triples (i,j,k), j,k>0, with i³=j³+binomial(k+2,3), ordered by increasing i; sequence gives j values. A54235

Number of n X 2 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 0,2,1,1,1 for x=0,1,2,3,4. A197883

a(n) is the least positive integer that can be expressed as the sum of two distinct nonzero decimal palindromes in exactly n ways. A364836

Number of weakly alternating ordered prime factorizations of n with at least two adjacent equal parts. A349798

k-digit numbers whose digit(s) are the number of distinct prime factors in each of the preceding k integers. A348266

Number of (binary) heaps of length n-k whose element set equals [k], where k is chosen so as to maximize this number. A373897

Number of (binary) heaps of length n whose element set equals {1,2,3}. A376962

"DFJ" (bracelet, size, labeled) transform of 1,3,5,7... A32212

The number of ways to color n balls in a row with 3 colors with no color runs having lengths greater than 4. This sequence is a special case of the general problem for coloring n balls in a row with p colors where each color has a given maximum run-length. In this example, the bounds are uniformly 4. It can be phrased in terms of tossing a p-faced die n times, requiring each face to have no runs longer than b. A181140