The article offers on the basis of functional characteristics of Lukasiewicz’s finite-valued logics a partition of a natural series of numbers into equivalence classes such that every class has one and only one prime number. This causes prime numbers to be represented as rooted trees. A hypothesis is suggested that such representation is finite for every prime number and necessary condition for it is specified.