Search a number
-
+
111009999053 is a prime number
BaseRepresentation
bin110011101100010110…
…1100010100011001101
3101121112110220020121102
41213120231202203031
53304322024432203
6122555225312445
711006634265052
oct1473055424315
9347473806542
10111009999053
1143096283378
1219621035725
13a611828395
1455313b5029
152d4ab01888
hex19d8b628cd

111009999053 has 2 divisors, whose sum is σ = 111009999054. Its totient is φ = 111009999052.

The previous prime is 111009999049. The next prime is 111009999083. The reversal of 111009999053 is 350999900111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 104990256484 + 6019742569 = 324022^2 + 77587^2 .

It is a cyclic number.

It is not a de Polignac number, because 111009999053 - 22 = 111009999049 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 2111009999053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 98415, while the sum is 47.

The spelling of 111009999053 in words is "one hundred eleven billion, nine million, nine hundred ninety-nine thousand, fifty-three".