Properties of the Number 32095

Thirty-Two Thousand Ninety-Five

Basics

Value: 32094 → 32095 → 32096

Parity: odd

Prime: No

Previous Prime: 32089

Next Prime: 32099

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 7 ² × 131

Divisors: 1, 5, 7, 35, 49, 131, 245, 655, 917, 4585

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111110101011111

Octal: 76537

Duodecimal: 166A7

Hexadecimal: 7d5f

Square: 1030089025

Square Root: 179.1507744889762

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

Expansion of 1/((1-x)²*∏_k>=1 (1-x^k)). A14153

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250898

Number of symmetrical planar partitions of n (planar partitions (A000219) that when regarded as 3-D objects have just one symmetry plane). A784

Number of magic labelings with magic sum n of first graph shown in link. A244869

Number of unlabeled connected graphs with n edges with degree >= 3 at each node. A338604

Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x² + (x+2)² + ... +(x+2n-2)² = k² for some integer k. For each n, this sequence gives the least value of k. A56132

Number of (n+1) X (7+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250897

Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250899

Numbers whose base-4 representation contains exactly four 1's and four 3's. A45133

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, -1), (1, 0, 0), (1, 1, 0)}. A150428