Search a number
-
+
10111101331 is a prime number
BaseRepresentation
bin10010110101010101…
…10010100110010011
3222002122211011111111
421122222302212103
5131201420220311
64351151554151
7505363641352
oct113252624623
928078734444
1010111101331
1143194a90a1
121b6222b957
13c51a19bc6
146bcc03999
153e2a06d21
hex25aab2993

10111101331 has 2 divisors, whose sum is σ = 10111101332. Its totient is φ = 10111101330.

The previous prime is 10111101263. The next prime is 10111101361. The reversal of 10111101331 is 13310111101.

10111101331 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 is a cyclic number.

It is not a de Polignac number, because 10111101331 - 233 = 1521166739 is a prime.

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

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

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

Almost surely, 210111101331 is an apocalyptic number.

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

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

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

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

Adding to 10111101331 its reverse (13310111101), we get a palindrome (23421212432).

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