Let x be the number, d the divisor.
x mod d = 22 which means x = nd + 22 for some integer n. -> (1)
Also, 2x mod d = 7 which means 2x = md + 7 for some integer m. ->(2)
2*(1) - (2) => 0 = (2n-m)d + 37, d = 37 / (m-2n)
d must be an integer and 37 is a prime number. So, only way is m - 2n = 1 (as d cannot be 1 here), which gives d = 37.
We can try n = 1 which gives x = 59
n = 2, gives x = 96
Likewise there are infinite solutions for x, but d is only 37.