Search a number
-
+
11490190273 is a prime number
BaseRepresentation
bin10101011001101111…
…00110001111000001
31002122202211010212201
422230313212033001
5142012442042043
65140054353201
7554511002002
oct125467461701
932582733781
1011490190273
114966a05021
12228805b801
131111656673
147b00311a9
15473b1ac4d
hex2acde63c1

11490190273 has 2 divisors, whose sum is σ = 11490190274. Its totient is φ = 11490190272.

The previous prime is 11490190237. The next prime is 11490190301. The reversal of 11490190273 is 37209109411.

Together with previous prime (11490190237) 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., 5826574224 + 5663616049 = 76332^2 + 75257^2 .

It is a cyclic number.

It is not a de Polignac number, because 11490190273 - 221 = 11488093121 is a prime.

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

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

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

Almost surely, 211490190273 is an apocalyptic number.

It is an amenable number.

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

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

11490190273 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 11490190273 its reverse (37209109411), we get a palindrome (48699299684).

The spelling of 11490190273 in words is "eleven billion, four hundred ninety million, one hundred ninety thousand, two hundred seventy-three".