Search a number
-
+
101010111101113 is a prime number
BaseRepresentation
bin10110111101111000111111…
…110010100111100010111001
3111020122110202022120002222011
4112331320333302213202321
5101214422201420213423
6554455223205125521
730163511500632214
oct2675707762474271
9436573668502864
10101010111101113
112a20416942aa85
12b3b45299b98a1
13444929c12b546
141ad2cb605c77b
15ba2788a3cb0d
hex5bde3fca78b9

101010111101113 has 2 divisors, whose sum is σ = 101010111101114. Its totient is φ = 101010111101112.

The previous prime is 101010111101071. The next prime is 101010111101143. The reversal of 101010111101113 is 311101111010101.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 98235314745129 + 2774796355984 = 9911373^2 + 1665772^2 .

It is a cyclic number.

It is not a de Polignac number, because 101010111101113 - 213 = 101010111092921 is a prime.

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

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

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

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

Almost surely, 2101010111101113 is an apocalyptic number.

It is an amenable number.

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

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

101010111101113 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 101010111101113 its reverse (311101111010101), we get a palindrome (412111222111214).

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