Search a number
-
+
11111001211153 is a prime number
BaseRepresentation
bin1010000110101111101101…
…0001111100000100010001
31110100012102210000110012001
42201223323101330010101
52424020312302224103
635344153512434001
72224512653000614
oct241537321740421
943305383013161
1011111001211153
1135a417057a858
1212b54779a8901
136279bc19349c
142a5abd70017b
1514405162201d
hexa1afb47c111

11111001211153 has 2 divisors, whose sum is σ = 11111001211154. Its totient is φ = 11111001211152.

The previous prime is 11111001211097. The next prime is 11111001211169. The reversal of 11111001211153 is 35111210011111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10248270469264 + 862730741889 = 3201292^2 + 928833^2 .

It is a cyclic number.

It is not a de Polignac number, because 11111001211153 - 29 = 11111001210641 is a prime.

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

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

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

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

Almost surely, 211111001211153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 19.

Adding to 11111001211153 its reverse (35111210011111), we get a palindrome (46222211222264).

The spelling of 11111001211153 in words is "eleven trillion, one hundred eleven billion, one million, two hundred eleven thousand, one hundred fifty-three".