Search a number
-
+
110200131203329 is a prime number
BaseRepresentation
bin11001000011100111110111…
…101011001011000100000001
3112110012000210121201021202001
4121003213313223023010001
5103421004332042001304
61030213124050024001
732132460660625546
oct3103476753130401
9473160717637661
10110200131203329
11321276821753a2
1210439634b78001
134964a9b83aa2b
141d2da01616bcd
15cb1859451da4
hex6439f7acb101

110200131203329 has 2 divisors, whose sum is σ = 110200131203330. Its totient is φ = 110200131203328.

The previous prime is 110200131203297. The next prime is 110200131203353. The reversal of 110200131203329 is 923302131002011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 59381696226304 + 50818434977025 = 7705952^2 + 7128705^2 .

It is a cyclic number.

It is not a de Polignac number, because 110200131203329 - 25 = 110200131203297 is a prime.

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

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

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

Almost surely, 2110200131203329 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1944, while the sum is 28.

The spelling of 110200131203329 in words is "one hundred ten trillion, two hundred billion, one hundred thirty-one million, two hundred three thousand, three hundred twenty-nine".