Search a number
-
+
101111201013013 is a prime number
BaseRepresentation
bin10110111111010111001001…
…001110000001110100010101
3111021000010200110001201021021
4112333113021032001310111
5101223101214424404023
6555013502224521141
730204020550666352
oct2677271116016425
9437003613051237
10101111201013013
112a243024010014
12b4100407801b1
13445598c698c69
141ad7b45b53629
15ba52037b935d
hex5bf5c9381d15

101111201013013 has 2 divisors, whose sum is σ = 101111201013014. Its totient is φ = 101111201013012.

The previous prime is 101111201012803. The next prime is 101111201013059. The reversal of 101111201013013 is 310310102111101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 87715549772964 + 13395651240049 = 9365658^2 + 3660007^2 .

It is a cyclic number.

It is not a de Polignac number, because 101111201013013 - 29 = 101111201012501 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101111201013013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18, while the sum is 16.

Adding to 101111201013013 its reverse (310310102111101), we get a palindrome (411421303124114).

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