Let pk(n) be the number of k-polymatroids on [n]. We show that for every fixed k≥1, we have ⌊2k⌋⋅(⌊n/2⌋n)⋅(1+o(1))≤log2pk(n)≤k⋅(⌊n/2⌋n)⋅(1+o(1)). We also show that for k≥2, almost all k-polymatroids are (i) connected, (ii) proper, and (iii) not linearly representable over any field.