# What is the pair $(n,k)$ called where $n$ is an integer and $k$ is the ordered factorization index?

I’m developing a number class (as in Object-Oriented Programming) and am wondering what to call it. At its core, it represents an integer, but in a way in which not all integers are unique. What it does treat as unique is the pair $(n,k)$, where $n$ is the represented integer and $k$ is the “flavor” (factorization) of that integer. Here, for example, are the 13 unique factorizations of the number 30:

 n#k
------------------
30#1  = 2 x 3 x 5
30#2  = 2 x 5 x 3
30#3  = 2 x 15
30#4  = 3 x 2 x 5
30#5  = 3 x 5 x 2
30#6  = 3 x 10
30#7  = 5 x 2 x 3
30#8  = 5 x 3 x 2
30#9  = 5 x 6
30#10 = 6 x 5
30#11 = 10 x 3
30#12 = 15 x 2
30#13 = 30


Wolfram MathWorld defines these as ordered factorizations: “An ordered factorization is a factorization (not necessarily into prime factors) in which $a$ × $b$ is considered distinct from $b$ × $a$.”

Thus, in the notation n#k, $k$ is an index into the list of ordered factorizations of $n$. I have methods to map from the index $k$ to its respective factorization, and vice-versa.

What I’m looking for is a word (or very short phrase) to go before the word “number” or “integer,” e.g., “indexed number” or “indexed integer.”

-