Search a number
-
+
1113767377601 is a prime number
BaseRepresentation
bin10000001101010001101…
…101010111101011000001
310221110211100211000100212
4100031101231113223001
5121221443422040401
62211354020123505
7143316123335444
oct20152155275301
93843740730325
101113767377601
1139a38971560a
1215ba32536595
138104914a358
143bc99b0965b
151de89483dbb
hex10351b57ac1

1113767377601 has 2 divisors, whose sum is σ = 1113767377602. Its totient is φ = 1113767377600.

The previous prime is 1113767377573. The next prime is 1113767377621. The reversal of 1113767377601 is 1067737673111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 672441000625 + 441326376976 = 820025^2 + 664324^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 21113767377601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 777924, while the sum is 50.

The spelling of 1113767377601 in words is "one trillion, one hundred thirteen billion, seven hundred sixty-seven million, three hundred seventy-seven thousand, six hundred one".