In a certain part of the logic (where many identical individual parts are not changed or destroyed, but only rearranged), a result that comes about using a simple basic calculation should also be able to be traced back using a simple basic calculation. If it is easy to get a certain result when you multiply two numbers (factors) together, it should not be difficult to "recalculate" this result back to its two factors with an equally simple basic calculation. This present work explicitly does not deal with the above-mentioned procedure, how a number, which has arisen from the multiplication of two numbers (in the practice of cryptography, these are prime numbers), is again broken down into these two prime numbers ("factored") ! The present manuscript is only intended to illustrate what is possible with the application of the basic calculation types, which are accessible to everyone. For this purpose we have asked ourselves how one can even without an algorithm that directly breaks down (factored) "large numbers" (products), can come to similarly useful results. A suggested solution could be: You can also indirectly identify the prime numbers from which large products have arisen by creating lists in which all the numbers in question are stored in an orderly manner, continuously increasing.