Search a number
-
+
11555616660073 is a prime number
BaseRepresentation
bin1010100000101000000001…
…1011010001101001101001
31111220201001210102110022221
42220022000123101221221
53003311400331110243
640324324344514041
72301602644651003
oct250120033215151
944821053373287
1011555616660073
113755789394292
12136768077b921
1365a8c7b50135
142bd41b02d373
151508c4ce7bed
hexa82806d1a69

11555616660073 has 2 divisors, whose sum is σ = 11555616660074. Its totient is φ = 11555616660072.

The previous prime is 11555616660031. The next prime is 11555616660131. The reversal of 11555616660073 is 37006661655511.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7280866062864 + 4274750597209 = 2698308^2 + 2067547^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (11555616660023) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5777808330036 + 5777808330037.

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

Almost surely, 211555616660073 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3402000, while the sum is 52.

The spelling of 11555616660073 in words is "eleven trillion, five hundred fifty-five billion, six hundred sixteen million, six hundred sixty thousand, seventy-three".