Search a number
-
+
111113100001 is a prime number
BaseRepresentation
bin110011101111011011…
…0110101101011100001
3101121210122220022112001
41213132312311223201
53310024423200001
6123013351204001
711012325523651
oct1473666655341
9347718808461
10111113100001
11431394a2672
121964b676601
13a629cb6467
145540d72361
152d54bba001
hex19dedb5ae1

111113100001 has 2 divisors, whose sum is σ = 111113100002. Its totient is φ = 111113100000.

The previous prime is 111113099953. The next prime is 111113100029. The reversal of 111113100001 is 100001311111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 107757910225 + 3355189776 = 328265^2 + 57924^2 .

It is a cyclic number.

It is not a de Polignac number, because 111113100001 - 27 = 111113099873 is a prime.

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

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

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

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

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

Almost surely, 2111113100001 is an apocalyptic number.

It is an amenable number.

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

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

111113100001 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 111113100001 its reverse (100001311111), we get a palindrome (211114411112).

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