Search a number
-
+
101101120002011 is a prime number
BaseRepresentation
bin10110111111001101110000…
…010110000001011111011011
3111020222011122212212021221102
4112333031300112001133123
5101222420043210031021
6555005114025502015
730203213000550623
oct2677156026013733
9436864585767842
10101101120002011
112a2398205a4268
12b40a0a864190b
134454a43c861ac
141ad746ad43883
15ba4d1375800b
hex5bf3705817db

101101120002011 has 2 divisors, whose sum is σ = 101101120002012. Its totient is φ = 101101120002010.

The previous prime is 101101120001977. The next prime is 101101120002053. The reversal of 101101120002011 is 110200021101101.

It is a weak prime.

It is an emirp because it is prime and its reverse (110200021101101) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101101120002011 is a prime.

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

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

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

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

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

Almost surely, 2101101120002011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 101101120002011 its reverse (110200021101101), we get a palindrome (211301141103112).

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