Search a number
-
+
1011111320077 is a prime number
BaseRepresentation
bin11101011011010101110…
…11100101101000001101
310120122212002022222011021
432231222323211220031
5113031223444220302
62052255332354141
7133023165262135
oct16555273455015
93518762288137
101011111320077
1135a89aa87151
12143b63175951
137446929b351
1436d1c013ac5
151b47be94437
hexeb6aee5a0d

1011111320077 has 2 divisors, whose sum is σ = 1011111320078. Its totient is φ = 1011111320076.

The previous prime is 1011111320057. The next prime is 1011111320123. The reversal of 1011111320077 is 7700231111101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 628953680356 + 382157639721 = 793066^2 + 618189^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 21011111320077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 294, while the sum is 25.

Adding to 1011111320077 its reverse (7700231111101), we get a palindrome (8711342431178).

The spelling of 1011111320077 in words is "one trillion, eleven billion, one hundred eleven million, three hundred twenty thousand, seventy-seven".