Search a number
-
+
11210211137 is a prime number
BaseRepresentation
bin10100111000010111…
…00011111101000001
31001221020222201201002
422130023203331001
5140424303224022
65052213421345
7544541136206
oct123413437501
931836881632
1011210211137
114832965604
12220a33a855
131098648638
14784b8dcad
15459264092
hex29c2e3f41

11210211137 has 2 divisors, whose sum is σ = 11210211138. Its totient is φ = 11210211136.

The previous prime is 11210211127. The next prime is 11210211143. The reversal of 11210211137 is 73111201211.

11210211137 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., 11043697921 + 166513216 = 105089^2 + 12904^2 .

It is a cyclic number.

It is not a de Polignac number, because 11210211137 - 24 = 11210211121 is a prime.

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

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

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

Almost surely, 211210211137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 84, while the sum is 20.

Adding to 11210211137 its reverse (73111201211), we get a palindrome (84321412348).

The spelling of 11210211137 in words is "eleven billion, two hundred ten million, two hundred eleven thousand, one hundred thirty-seven".