Search a number
-
+
11041200013 is a prime number
BaseRepresentation
bin10100100100001101…
…10101011110001101
31001111110222002000211
422102012311132031
5140103021400023
65023335122421
7540416436334
oct122206653615
931443862024
1011041200013
114756518a98
122181813411
13106c62145c
1476a556d1b
154494cba0d
hex2921b578d

11041200013 has 2 divisors, whose sum is σ = 11041200014. Its totient is φ = 11041200012.

The previous prime is 11041199993. The next prime is 11041200043. The reversal of 11041200013 is 31000214011.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7666403364 + 3374796649 = 87558^2 + 58093^2 .

It is a cyclic number.

It is not a de Polignac number, because 11041200013 - 221 = 11039102861 is a prime.

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

It is a congruent number.

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

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

Almost surely, 211041200013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24, while the sum is 13.

Adding to 11041200013 its reverse (31000214011), we get a palindrome (42041414024).

The spelling of 11041200013 in words is "eleven billion, forty-one million, two hundred thousand, thirteen".