Search a number
-
+
110110110102101 is a prime number
BaseRepresentation
bin11001000010010100000001…
…111111111011001001010101
3112102212102102220010112011202
4121002110001333323021111
5103413021001141231401
61030103515233242245
732123123114115434
oct3102240177731125
9472772386115152
10110110110102101
11320a248765167a
12104240b1103385
13495945353b025
141d295019c511b
15cae33b30806b
hex642501ffb255

110110110102101 has 2 divisors, whose sum is σ = 110110110102102. Its totient is φ = 110110110102100.

The previous prime is 110110110102071. The next prime is 110110110102133. The reversal of 110110110102101 is 101201011011011.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 108957042186001 + 1153067916100 = 10438249^2 + 1073810^2 .

It is a cyclic number.

It is not a de Polignac number, because 110110110102101 - 222 = 110110105907797 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2110110110102101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 110110110102101 its reverse (101201011011011), we get a palindrome (211311121113112).

The spelling of 110110110102101 in words is "one hundred ten trillion, one hundred ten billion, one hundred ten million, one hundred two thousand, one hundred one".