Search a number
-
+
110111201051 is a prime number
BaseRepresentation
bin110011010001100100…
…0111001011100011011
3101112012211122120112112
41212203020321130123
53301001431413201
6122330121102535
710645441523525
oct1464310713433
9345184576475
10110111201051
11427749a2105
1219410027a4b
13a4ca562b47
145487c8ca15
152ce6c610bb
hex19a323971b

110111201051 has 2 divisors, whose sum is σ = 110111201052. Its totient is φ = 110111201050.

The previous prime is 110111201023. The next prime is 110111201089. The reversal of 110111201051 is 150102111011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 110111201051 - 210 = 110111200027 is a prime.

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

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

Almost surely, 2110111201051 is an apocalyptic number.

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

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

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

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

Adding to 110111201051 its reverse (150102111011), we get a palindrome (260213312062).

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