Properties of the Number 32340

Thirty-Two Thousand Three Hundred Forty

Basics

Value: 32339 → 32340 → 32341

Parity: even

Prime: No

Previous Prime: 32327

Next Prime: 32341

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 5 × 7 ² × 11

Divisors: 1, 2, 3, 4, 5, 6, 7, 10, 11, 12

Polygonal

Triangular: No

Square: No

Pentagonal: Yes

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 111111001010100

Octal: 77124

Duodecimal: 16870

Hexadecimal: 7e54

Square: 1045875600

Square Root: 179.8332561013118

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 of B-analogs of Stirling numbers of the second kind. A39755

a(n) = n²*(n² - 1)/6. A8911

Square array A(row,col): A(row,1) = A276155(row), and for col > 1, A(row,col) = A276154(A(row,col-1)); Dispersion of primorial base left shift A276154. A276945

Numbers k such that k is a multiple of A327860(k), where A327860 is the arithmetic derivative of the primorial base exp-function. A380527

Numbers with exactly 5 distinct prime divisors {2,3,5,7,11}. A147572

Square array A(row,col) read by antidiagonals: A(1,col) = A276155(col), and for row > 1, A(row,col) = A276154(A(row-1,col)); Dispersion of primorial base left shift A276154 (array transposed). A276943

Triangle read by rows: T(n,k) = A002110(n) + A002110(k), 0 <= k <= n; sums of two primorials, not necessarily distinct. A370121

Square array A(row,col) = ∑_k=0..row binomial(row,k)*A002110(col+k), read by descending antidiagonals as A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), ... A276586

Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument. A328762

a(n) = ∏_d∣n A019565(d)^A010051(n/d). A329352