Search a number
-
+
111100010111113 is a prime number
BaseRepresentation
bin11001010000101101111100…
…101000110010000010001001
3112120101001112201122020200111
4121100231330220302002021
5104030230310042023423
61032142350130034321
732254465551265552
oct3120557450620211
9476331481566614
10111100010111113
1132444282377881
1210563b147189a1
1349cb8bc1a9a2a
141d613aa8bb329
15cc9e7600e60d
hex650b7ca32089

111100010111113 has 2 divisors, whose sum is σ = 111100010111114. Its totient is φ = 111100010111112.

The previous prime is 111100010111063. The next prime is 111100010111171. The reversal of 111100010111113 is 311111010001111.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 93813016946944 + 17286993164169 = 9685712^2 + 4157763^2 .

It is a cyclic number.

It is not a de Polignac number, because 111100010111113 - 241 = 108900986855561 is a prime.

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

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

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

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

Almost surely, 2111100010111113 is an apocalyptic number.

It is an amenable number.

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

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

111100010111113 is an evil number, because the sum of its binary digits is even.

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

Adding to 111100010111113 its reverse (311111010001111), we get a palindrome (422211020112224).

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