Identities related to integer partitions and complete Bell polynomials

Using the (universal) Theorem for the integer partitions and the $q$-binomial Theorem, we give arithmetical and combinatorial identities for the complete Bell polynomials as generating functions for the number of partitions of a given integer into $k$ parts and the number of partitions of $n$ into a given number of parts.