Search a number
-
+
110200030151 is a prime number
BaseRepresentation
bin110011010100001101…
…1110000001111000111
3101112110000210120011012
41212220123300033013
53301142201431101
6122343013032435
710650600541511
oct1465033601707
9345400716135
10110200030151
1142810053792
121943592571b
13a512a94b43
1454959b2bb1
152cee95abbb
hex19a86f03c7

110200030151 has 2 divisors, whose sum is σ = 110200030152. Its totient is φ = 110200030150.

The previous prime is 110200029959. The next prime is 110200030169. The reversal of 110200030151 is 151030002011.

It is a strong prime.

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2110200030151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 14.

Adding to 110200030151 its reverse (151030002011), we get a palindrome (261230032162).

The spelling of 110200030151 in words is "one hundred ten billion, two hundred million, thirty thousand, one hundred fifty-one".