  Suppose a set of $m$-partite, $m\geq3$, pure orthogonal fully separable
states is given. We consider the task of distinguishing these states perfectly
by local operations and classical communication (LOCC) in different
$k$-partitions, $1<k<m$. Based on this task, it is possible to classify the
sets of product states into different classes. For tripartite systems, a
classification of the sets with explicit examples is presented. Few important
cases related to the aforesaid task are also studied when the number of
parties, $m\geq4$. These cases never appear for a tripartite system. However,
to distinguish any LOCC indistinguishable set, entanglement can be used as
resource. An important objective of the present study is to learn about the
efficient ways of resource sharing among the parties. We also find an
interesting application of multipartite product states which are LOCC
indistinguishable in a particular $k$-partition. Starting from such product
states, we constitute a protocol to distribute bound entanglement between two
spatially separated parties by sending a separable qubit.
