Search a number
-
+
110200111576913 is a prime number
BaseRepresentation
bin11001000011100111110110…
…100000010011011101010001
3112110012000202020210011100202
4121003213312200103131101
5103421004312030430123
61030213122105224545
732132460332043641
oct3103476640233521
9473160666704322
10110200111576913
113212767208a816
121043962a492155
134964a97758677
141d2d9dcb88521
15cb1857876a28
hex6439f6813751

110200111576913 has 2 divisors, whose sum is σ = 110200111576914. Its totient is φ = 110200111576912.

The previous prime is 110200111576903. The next prime is 110200111576963. The reversal of 110200111576913 is 319675111002011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102058950470929 + 8141161105984 = 10102423^2 + 2853272^2 .

It is a cyclic number.

It is not a de Polignac number, because 110200111576913 - 214 = 110200111560529 is a prime.

It is not a weakly prime, because it can be changed into another prime (110200111576903) 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, 55100055788456 + 55100055788457.

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

Almost surely, 2110200111576913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11340, while the sum is 38.

Adding to 110200111576913 its reverse (319675111002011), we get a palindrome (429875222578924).

The spelling of 110200111576913 in words is "one hundred ten trillion, two hundred billion, one hundred eleven million, five hundred seventy-six thousand, nine hundred thirteen".