Search a number
-
+
11122200961 is a prime number
BaseRepresentation
bin10100101101110111…
…10101000110000001
31001201010101100102221
422112323311012001
5140234240412321
65035351211041
7542422101604
oct122673650601
931633340387
1011122200961
114798213223
1221a4976a81
131083342301
1477720033b
1545167be41
hex296ef5181

11122200961 has 2 divisors, whose sum is σ = 11122200962. Its totient is φ = 11122200960.

The previous prime is 11122200911. The next prime is 11122201003. The reversal of 11122200961 is 16900222111.

It is a happy number.

11122200961 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., 10257840961 + 864360000 = 101281^2 + 29400^2 .

It is an emirp because it is prime and its reverse (16900222111) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11122200961 - 233 = 2532266369 is a prime.

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

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

Almost surely, 211122200961 is an apocalyptic number.

It is an amenable number.

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

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

11122200961 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 25.

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