Properties of the Number 32313

Thirty-Two Thousand Three Hundred Thirteen

Basics

Value: 32312 → 32313 → 32314

Parity: odd

Prime: No

Previous Prime: 32309

Next Prime: 32321

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 10771

Divisors: 1, 3, 10771, 32313

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111111000111001

Octal: 77071

Duodecimal: 16849

Hexadecimal: 7e39

Square: 1044129969

Square Root: 179.75817088522012

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 inequivalent colorings of lone-child-avoiding rooted trees with n colored leaves using exactly k colors. A339645

T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nXk array. A219063

Least power of 3 having exactly n consecutive 9's in its decimal representation. A131544

a(n) = (1/9)*((6·n - 7)*2^n-1 - (-1)ⁿ). A113861

Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x. A48131

Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nX5 array. A219060

Hilltop maps: number of 3Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 3Xn array. A219064

a(0)=0, a(1)=1, a(n) = min{4 a(k) + (4^n-k-1)/3, k=0..(n-1)} for n>=2. A259665

a(n) = -Floor[n/2]! + Sum[(Eulerian[n - j, j]), {j, 0, Floor[n/2]}]. A174993

Squarefree numbers k for which Q(k) - 6·k/π² sets a new record minimum, where Q(x) is the number of squarefree numbers up to x. A339865