Search a number
-
+
101101201001113 is a prime number
BaseRepresentation
bin10110111111001101110101…
…001011000000101010011001
3111020222011212112021110211011
4112333031311023000222121
5101222420224424013423
6555005130041533521
730203215003204615
oct2677156513005231
9436864775243734
10101101201001113
112a239862298075
12b40a10b7a42a1
134454a579a6261
141ad74779ca345
15ba4d1a907b0d
hex5bf3752c0a99

101101201001113 has 2 divisors, whose sum is σ = 101101201001114. Its totient is φ = 101101201001112.

The previous prime is 101101201001093. The next prime is 101101201001149. The reversal of 101101201001113 is 311100102101101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 63764249503504 + 37336951497609 = 7985252^2 + 6110397^2 .

It is a cyclic number.

It is not a de Polignac number, because 101101201001113 - 221 = 101101198903961 is a prime.

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

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

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

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

Almost surely, 2101101201001113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 101101201001113 its reverse (311100102101101), we get a palindrome (412201303102214).

The spelling of 101101201001113 in words is "one hundred one trillion, one hundred one billion, two hundred one million, one thousand, one hundred thirteen".