Search a number
-
+
110011110011093 is a prime number
BaseRepresentation
bin11001000000110111110101…
…001000100011000011010101
3112102111221220101222211012102
4121000313311020203003111
5103404410223130323333
61025550223425531445
732113016601201464
oct3100676510430325
9472457811884172
10110011110011093
11320644a4687a45
1210408a821a3b85
134950006c36215
141d247cd68a9db
15cab994c82ae8
hex640df52230d5

110011110011093 has 2 divisors, whose sum is σ = 110011110011094. Its totient is φ = 110011110011092.

The previous prime is 110011110011083. The next prime is 110011110011107. The reversal of 110011110011093 is 390110011110011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 109374302819089 + 636807192004 = 10458217^2 + 798002^2 .

It is a cyclic number.

It is not a de Polignac number, because 110011110011093 - 242 = 105613063499989 is a prime.

It is a super-3 number, since 3×1100111100110933 (a number of 43 digits) contains 333 as substring.

It is a congruent number.

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

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

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

Almost surely, 2110011110011093 is an apocalyptic number.

It is an amenable number.

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

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

110011110011093 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 20.

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