Search a number
-
+
11122210011961 is a prime number
BaseRepresentation
bin1010000111011001011101…
…1000000111101100111001
31110101021100221100112021201
42201312113120013230321
52424211241230340321
635353250040134201
72225360506144306
oct241662730075471
943337327315251
1011122210011961
1135a89a26617a4
1212b7685767361
13628a87436bb9
142a64642040ad
151444aa6a8291
hexa1d97607b39

11122210011961 has 2 divisors, whose sum is σ = 11122210011962. Its totient is φ = 11122210011960.

The previous prime is 11122210011911. The next prime is 11122210011989. The reversal of 11122210011961 is 16911001222111.

It is an a-pointer prime, because the next prime (11122210011989) can be obtained adding 11122210011961 to its sum of digits (28).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9366850001961 + 1755360010000 = 3060531^2 + 1324900^2 .

It is a cyclic number.

It is not a de Polignac number, because 11122210011961 - 213 = 11122210003769 is a prime.

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

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

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

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

Almost surely, 211122210011961 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11122210011961 in words is "eleven trillion, one hundred twenty-two billion, two hundred ten million, eleven thousand, nine hundred sixty-one".