1606050737 has 2 divisors, whose sum is σ = 1606050738. Its totient is φ = 1606050736.

The previous prime is 1606050661. The next prime is 1606050773. The reversal of 1606050737 is 7370506061.

Together with next prime (1606050773) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1222830961 + 383219776 = 34969^2 + 19576^2 .

It is an emirp because it is prime and its reverse (7370506061) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1606050737 - 2¹⁶ = 1605985201 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1606050697 and 1606050706.

It is not a weakly prime, because it can be changed into another prime (1606050037) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 803025368 + 803025369.

It is an arithmetic number, because the mean of its divisors is an integer number (803025369).

Almost surely, 2^1606050737 is an apocalyptic number.

It is an amenable number.

1606050737 is a deficient number, since it is larger than the sum of its proper divisors (1).

1606050737 is an equidigital number, since it uses as much as digits as its factorization.

1606050737 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 26460, while the sum is 35.

The square root of 1606050737 is about 40075.5628407138. The cubic root of 1606050737 is about 1171.0796124906.

Adding to 1606050737 its reverse (7370506061), we get a palindrome (8976556798).

The spelling of 1606050737 in words is "one billion, six hundred six million, fifty thousand, seven hundred thirty-seven".