Search a number
-
+
110100101011093 is a prime number
BaseRepresentation
bin11001000010001010101101…
…011010010001011010010101
3112102211110121100021000112101
4121002022231122101122111
5103412340001324323333
61030055142123522101
732122320066211204
oct3102125532213225
9472743540230471
10110100101011093
1132099210798436
1210422179089331
1349585199b997b
141d28c3257723b
15cade5275167d
hex6422ad691695

110100101011093 has 2 divisors, whose sum is σ = 110100101011094. Its totient is φ = 110100101011092.

The previous prime is 110100101011079. The next prime is 110100101011133. The reversal of 110100101011093 is 390110101001011.

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., 58958179766929 + 51141921244164 = 7678423^2 + 7151358^2 .

It is a cyclic number.

It is not a de Polignac number, because 110100101011093 - 225 = 110100067456661 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 110100101011093.

It is a congruent number.

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

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

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

Almost surely, 2110100101011093 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 19.

The spelling of 110100101011093 in words is "one hundred ten trillion, one hundred billion, one hundred one million, eleven thousand, ninety-three".