Search a number
-
+
101101011201013 is a prime number
BaseRepresentation
bin10110111111001101101001…
…110110111110101111110101
3111020222011101022010122000211
4112333031221312332233311
5101222414332331413023
6555005055141505421
730203210210011555
oct2677155166765765
9436864338118024
10101101011201013
112a23977514148a
12b40a078112271
134454a275807c5
141ad745a701165
15ba4d08e15a0d
hex5bf369dbebf5

101101011201013 has 2 divisors, whose sum is σ = 101101011201014. Its totient is φ = 101101011201012.

The previous prime is 101101011200879. The next prime is 101101011201107. The reversal of 101101011201013 is 310102110101101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 76089629905969 + 25011381295044 = 8722937^2 + 5001138^2 .

It is a cyclic number.

It is not a de Polignac number, because 101101011201013 - 229 = 101100474330101 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101101011201013 is an apocalyptic number.

It is an amenable number.

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

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

101101011201013 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 101101011201013 its reverse (310102110101101), we get a palindrome (411203121302114).

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