Search a number
-
+
110109996926707 is a prime number
BaseRepresentation
bin11001000010010011111011…
…010000001100011011110011
3112102212102011000011121201111
4121002103323100030123303
5103413020233203123312
61030103500111414151
732123120241130141
oct3102237320143363
9472772130147644
10110109996926707
11320a2429781298
121042407b224357
134959435c6353b
141d294d0964591
15cae3313ee8a7
hex6424fb40c6f3

110109996926707 has 2 divisors, whose sum is σ = 110109996926708. Its totient is φ = 110109996926706.

The previous prime is 110109996926653. The next prime is 110109996926731. The reversal of 110109996926707 is 707629699901011.

It is a strong prime.

It is an emirp because it is prime and its reverse (707629699901011) is a distict prime.

It is a cyclic number.

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

It is a super-2 number, since 2×1101099969267072 (a number of 29 digits) contains 22 as substring.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2110109996926707 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 23147208, while the sum is 67.

The spelling of 110109996926707 in words is "one hundred ten trillion, one hundred nine billion, nine hundred ninety-six million, nine hundred twenty-six thousand, seven hundred seven".