Search a number
-
+
10110011113 is a prime number
BaseRepresentation
bin10010110101001101…
…01000011011101001
3222002120202210000001
421122212220123221
5131201130323423
64351112343001
7505351451026
oct113246503351
928076683001
1010110011113
114318923a94
121b619a4a61
13c517278c7
146bc9dc54d
153e288dcad
hex25a9a86e9

10110011113 has 2 divisors, whose sum is σ = 10110011114. Its totient is φ = 10110011112.

The previous prime is 10110011099. The next prime is 10110011137. The reversal of 10110011113 is 31111001101.

10110011113 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., 10026617689 + 83393424 = 100133^2 + 9132^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10110011113 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10110011113.

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

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

Almost surely, 210110011113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 10110011113 its reverse (31111001101), we get a palindrome (41221012214).

The spelling of 10110011113 in words is "ten billion, one hundred ten million, eleven thousand, one hundred thirteen".