Search a number
-
+
11110210031 is a prime number
BaseRepresentation
bin10100101100011100…
…00101100111101111
31001200021211010222102
422112032011213233
5140223203210111
65034242205315
7542215140614
oct122616054757
931607733872
1011110210031
114791473268
1221a095383b
131080a0449b
1477579c50b
154505ae13b
hex2963859ef

11110210031 has 2 divisors, whose sum is σ = 11110210032. Its totient is φ = 11110210030.

The previous prime is 11110210019. The next prime is 11110210037. The reversal of 11110210031 is 13001201111.

It is a happy number.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 11110210031 - 230 = 10036468207 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 211110210031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 11.

Adding to 11110210031 its reverse (13001201111), we get a palindrome (24111411142).

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