cache tag calculation

how would you calculate the cache tag?
is there a way to break a binary address into it's separate parts?
i know that we the block address is calculated by dividing the byte address by the block size. i know the set index is calculated by modulating the block address by the total number of sets. but how do you calculate the cache tag?

Treat the address as an unsigned long say, then use bitwise operators to mask off certain groups of bits.