Search a number
-
+
11140527511 is a prime number
BaseRepresentation
bin10100110000000011…
…01111010110010111
31001202101212102202001
422120001233112113
5140303433340021
65041244100131
7543033631021
oct123001572627
931671772661
1011140527511
1147a75a0233
1221aab34647
13108708ab19
14779811011
1545309c091
hex29806f597

11140527511 has 2 divisors, whose sum is σ = 11140527512. Its totient is φ = 11140527510.

The previous prime is 11140527493. The next prime is 11140527523. The reversal of 11140527511 is 11572504111.

11140527511 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 is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11140527511 is a prime.

It is a super-2 number, since 2×111405275112 (a number of 21 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 11140527511.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11140527551) 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, 5570263755 + 5570263756.

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

Almost surely, 211140527511 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1400, while the sum is 28.

The spelling of 11140527511 in words is "eleven billion, one hundred forty million, five hundred twenty-seven thousand, five hundred eleven".