Search a number
-
+
101120112021101 is a prime number
BaseRepresentation
bin10110111111011111011100…
…010110110100111001101101
3111021000222200110200211022212
4112333133130112310321231
5101223222442134133401
6555021534350420205
730204454433213645
oct2677373426647155
9437028613624285
10101120112021101
112a246887049308
12b411908b01665
13445677c88b104
141ad834d401525
15ba5575c67dbb
hex5bf7dc5b4e6d

101120112021101 has 2 divisors, whose sum is σ = 101120112021102. Its totient is φ = 101120112021100.

The previous prime is 101120112020999. The next prime is 101120112021121. The reversal of 101120112021101 is 101120211021101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 86340316218601 + 14779795802500 = 9291949^2 + 3844450^2 .

It is a cyclic number.

It is not a de Polignac number, because 101120112021101 - 218 = 101120111758957 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (101120112021121) 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, 50560056010550 + 50560056010551.

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

Almost surely, 2101120112021101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 14.

Adding to 101120112021101 its reverse (101120211021101), we get a palindrome (202240323042202).

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