Search a number
-
+
11102061037 is a prime number
BaseRepresentation
bin10100101011011110…
…00000000111101101
31001122201111010122211
422111233000013231
5140214111423122
65033351410421
7542055650614
oct122557000755
931581433584
1011102061037
114787907861
12219a083a11
13107c1102b2
1477467a87b
1544e9ee877
hex295bc01ed

11102061037 has 2 divisors, whose sum is σ = 11102061038. Its totient is φ = 11102061036.

The previous prime is 11102061029. The next prime is 11102061043. The reversal of 11102061037 is 73016020111.

11102061037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11101993956 + 67081 = 105366^2 + 259^2 .

It is a cyclic number.

It is not a de Polignac number, because 11102061037 - 23 = 11102061029 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 211102061037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 252, while the sum is 22.

Adding to 11102061037 its reverse (73016020111), we get a palindrome (84118081148).

The spelling of 11102061037 in words is "eleven billion, one hundred two million, sixty-one thousand, thirty-seven".