Search a number
-
+
110110110010009 is a prime number
BaseRepresentation
bin11001000010010100000001…
…111111100100101010011001
3112102212102102212221211211221
4121002110001333210222121
5103413021001130310014
61030103515231252041
732123123113253104
oct3102240177445231
9472772385854757
10110110110010009
11320a248759946a
12104240b107a021
134959453508135
141d2950199d73b
15cae33b2dab24
hex642501fe4a99

110110110010009 has 2 divisors, whose sum is σ = 110110110010010. Its totient is φ = 110110110010008.

The previous prime is 110110110009961. The next prime is 110110110010027. The reversal of 110110110010009 is 900010011011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102792933529225 + 7317176480784 = 10138685^2 + 2705028^2 .

It is a cyclic number.

It is not a de Polignac number, because 110110110010009 - 27 = 110110110009881 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 110110110009974 and 110110110010001.

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

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

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

Almost surely, 2110110110010009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9, while the sum is 16.

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