Search a number
-
+
101101000201013 is a prime number
BaseRepresentation
bin10110111111001101101001…
…001101000001001100110101
3111020222011100112102202212102
4112333031221031001030311
5101222414322022413023
6555005054110031445
730203210014345601
oct2677155115011465
9436864315382772
10101101000201013
112a239769a08a7a
12b40a0744a8585
134454a251cba27
141ad745907a501
15ba4d07e91628
hex5bf369341335

101101000201013 has 2 divisors, whose sum is σ = 101101000201014. Its totient is φ = 101101000201012.

The previous prime is 101101000200979. The next prime is 101101000201027. The reversal of 101101000201013 is 310102000101101.

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., 100139388539089 + 961611661924 = 10006967^2 + 980618^2 .

It is a cyclic number.

It is not a de Polignac number, because 101101000201013 - 210 = 101101000199989 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101101000201013 is an apocalyptic number.

It is an amenable number.

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

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

101101000201013 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 11.

Adding to 101101000201013 its reverse (310102000101101), we get a palindrome (411203000302114).

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