Search a number
-
+
1110101110093 is a prime number
BaseRepresentation
bin10000001001110111001…
…011101010110101001101
310221010100212002022211101
4100021313023222311031
5121141441341010333
62205550131223101
7143126224514053
oct20116713526515
93833325068741
101110101110093
11398878155568
1215b18a747a91
13808b37075b1
143ba2cc2a1d3
151dd2268267d
hex102772ead4d

1110101110093 has 2 divisors, whose sum is σ = 1110101110094. Its totient is φ = 1110101110092.

The previous prime is 1110101110091. The next prime is 1110101110187. The reversal of 1110101110093 is 3900111010111.

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., 739837379044 + 370263731049 = 860138^2 + 608493^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110101110093 - 21 = 1110101110091 is a prime.

Together with 1110101110091, it forms a pair of twin primes.

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

It is a congruent number.

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

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

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

Almost surely, 21110101110093 is an apocalyptic number.

It is an amenable number.

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

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

1110101110093 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 1110101110093 in words is "one trillion, one hundred ten billion, one hundred one million, one hundred ten thousand, ninety-three".