11490190237 has 2 divisors, whose sum is σ = 11490190238. Its totient is φ = 11490190236.

The previous prime is 11490190219. The next prime is 11490190273. The reversal of 11490190237 is 73209109411.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10850555556 + 639634681 = 104166^2 + 25291^2 .

It is a cyclic number.

It is not a de Polignac number, because 11490190237 - 2³¹ = 9342706589 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2^11490190237 is an apocalyptic number.

It is an amenable number.

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

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

11490190237 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 13608, while the sum is 37.

Adding to 11490190237 its reverse (73209109411), we get a palindrome (84699299648).

The spelling of 11490190237 in words is "eleven billion, four hundred ninety million, one hundred ninety thousand, two hundred thirty-seven".