Search a number
-
+
101101012220141 is a prime number
BaseRepresentation
bin10110111111001101101001…
…111010110111100011101101
3111020222011101101001102000022
4112333031221322313203231
5101222414333112021031
6555005055215411525
730203210221455023
oct2677155172674355
9436864341042008
10101101012220141
112a23977577813a
12b40a078523ba5
134454a2784963b
141ad745a8c8713
15ba4d0906797b
hex5bf369eb78ed

101101012220141 has 2 divisors, whose sum is σ = 101101012220142. Its totient is φ = 101101012220140.

The previous prime is 101101012220083. The next prime is 101101012220227. The reversal of 101101012220141 is 141022210101101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 80976331729225 + 20124680490916 = 8998685^2 + 4486054^2 .

It is a cyclic number.

It is not a de Polignac number, because 101101012220141 - 26 = 101101012220077 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

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

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

Almost surely, 2101101012220141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32, while the sum is 17.

Adding to 101101012220141 its reverse (141022210101101), we get a palindrome (242123222321242).

The spelling of 101101012220141 in words is "one hundred one trillion, one hundred one billion, twelve million, two hundred twenty thousand, one hundred forty-one".