Search a number
-
+
110110109837957 is a prime number
BaseRepresentation
bin11001000010010100000001…
…111110111010101010000101
3112102212102102212122002211122
4121002110001332322222011
5103413021001104303312
61030103515223443325
732123123111635355
oct3102240176725205
9472772385562748
10110110109837957
11320a2487491179
12104240b0bb6545
134959453477a28
141d29501956b65
15cae33b2a4b72
hex642501fbaa85

110110109837957 has 2 divisors, whose sum is σ = 110110109837958. Its totient is φ = 110110109837956.

The previous prime is 110110109837939. The next prime is 110110109837983. The reversal of 110110109837957 is 759738901011011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 69714500929441 + 40395608908516 = 8349521^2 + 6355754^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110110109837957 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2110110109837957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 476280, while the sum is 53.

The spelling of 110110109837957 in words is "one hundred ten trillion, one hundred ten billion, one hundred nine million, eight hundred thirty-seven thousand, nine hundred fifty-seven".