We provide an axiomatic base for the set of natural numbers, that has been proposed as a canonical construction, and use this definition of $\mathbb N$ to find several results on finite group theory. Every finite group $G$, is well represented with a natural number $N_G$; if $N_G=N_H$ then $H,G$ are in the same isomorphism class. We have a linear order on all finite groups, that is well behaved with respect to cardinality. In fact, if $H,G$ are two finite groups such that $|H|=m<n=|G|$, then $H<\mathbb Z_n\leq G$. Internally, there is also a canonical order for the elements of any finite group $G$, and we find equivalent objects. This allows us to find the automorphisms of $G$. The Cayley table of $G$ takes canonical block form, and a minimal set of independent equations that define the group is obtained. Examples are given, using all groups with less than ten elements, to illustrate the procedure for finding all groups of $n$ elements, and we order them externally and internally. The canonical block form of the symmetry group $\Delta_4$ is given and we find its automorphisms. These results are extended to the infinite case. A real number is an infinite set of natural numbers. A real function is a set of real numbers, and a sequence of real functions $f_1,f_2,\ldots$ is well represented by a set of real numbers, also. We make brief mention on the calculus of real numbers. In general, we are able to represent mathematical objects using the smallest possible data-type. In the last section, mathematical objects of all types are well assigned to tree structures. We conclude with comments on type theory and future work on computational and physical aspects of these representations.