Search a number
-
+
1011110200117 is a prime number
BaseRepresentation
bin11101011011010101101…
…11010100001100110101
310120122212000020001212021
432231222313110030311
5113031223202400432
62052255252353141
7133023152616013
oct16555267241465
93518760201767
101011110200117
1135a89a391766
12143b629157b1
1374468c98654
1436d1bc018b3
151b47bd22697
hexeb6add4335

1011110200117 has 2 divisors, whose sum is σ = 1011110200118. Its totient is φ = 1011110200116.

The previous prime is 1011110200007. The next prime is 1011110200129. The reversal of 1011110200117 is 7110020111101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 997533522756 + 13576677361 = 998766^2 + 116519^2 .

It is a cyclic number.

It is not a de Polignac number, because 1011110200117 - 211 = 1011110198069 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1011110200117.

It is a congruent number.

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

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

Almost surely, 21011110200117 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1011110200117 its reverse (7110020111101), we get a palindrome (8121130311218).

The spelling of 1011110200117 in words is "one trillion, eleven billion, one hundred ten million, two hundred thousand, one hundred seventeen".