Is there a technique to confirm that a given large integer value is a product of two primes? Given a list of 2048 bit integer values in which one or few 2048 bit integer values 
may be product of two prime numbers and other values may be just 2048 bit odd integers numbers. 

My question is - 
Is there a way / technique (apart from brute-force) to confirm that a given 2048 bit integer value is product of two prime numbers or not?

Is there any pattern in an integer value which is not product of two prime numbers?
No, there is no known test that we can run on a 2048 bit composite number that would indicate whether it was the product of two primes, or whether it was the product of more than two primes.

About the closest we can get is a zero knowledge proof; we know how someone (who does know the factorization) can run an interactive proof with us that can demonstrate to us that there are only two prime factors (and not reveal anything else).  However, that does not appear what you're asking for.