Search a number
-
+
110102003201 is a prime number
BaseRepresentation
bin110011010001010010…
…1110011111000000001
3101112012012100021110102
41212202211303320001
53300442103100301
6122325152012145
710645300404611
oct1464245637001
9345165307412
10110102003201
114276a78a683
1219408b31055
13a4c8692428
145486976a41
152ce6045b6b
hex19a2973e01

110102003201 has 2 divisors, whose sum is σ = 110102003202. Its totient is φ = 110102003200.

The previous prime is 110102003183. The next prime is 110102003251. The reversal of 110102003201 is 102300201011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 59036850625 + 51065152576 = 242975^2 + 225976^2 .

It is a cyclic number.

It is not a de Polignac number, because 110102003201 - 226 = 110034894337 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2110102003201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 11.

Adding to 110102003201 its reverse (102300201011), we get a palindrome (212402204212).

The spelling of 110102003201 in words is "one hundred ten billion, one hundred two million, three thousand, two hundred one".