Properties of the Number 32870

Thirty-Two Thousand Eight Hundred Seventy

Basics

Value: 32869 → 32870 → 32871

Parity: even

Prime: No

Previous Prime: 32869

Next Prime: 32887

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 19 × 173

Divisors: 1, 2, 5, 10, 19, 38, 95, 173, 190, 346

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000001100110

Octal: 100146

Duodecimal: 17032

Hexadecimal: 8066

Square: 1080436900

Square Root: 181.30085493455346

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

Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d·r(n-k) for k=2,3,...,n, d=(-1)^k+1, n >= 2, r(h)=sum of the numbers in row h of T. A54098

a(n) = number of special odd permutations of 2·n+1. A3110

Number of stacks of odd length in all 2ndary structures of size n. A202846

Numbers n such that Lucas(prime(n)) is prime, where Lucas = A000032. A120561

List of free 4-dimensional polyhypercubes in binary code (see A365139), ordered first by the number of cells, then by the value of the binary code. A365140

T(n,n-3), array T as in A054098. A54103

Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k U steps (0 <= k <= floor(n/2)). A132883

Number of (n+1) X (6+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction. A250609

Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/3)). A114711

a(n) = prime(n)*(prime(n + 1) + 1) - (n³ + sum of digits of n³). A123139