Search a number
-
+
11051641466683 is a prime number
BaseRepresentation
bin1010000011010010100100…
…1010011110111100111011
31110010112012220011222220121
42200310221022132330323
52422032230203413213
635301015355234111
72220311656333246
oct240645112367473
943115186158817
1011051641466683
113580a7a5461a4
1212a5a70448937
1362221c287b2c
142a2c8bcb225d
1514272a1de88d
hexa0d2929ef3b

11051641466683 has 2 divisors, whose sum is σ = 11051641466684. Its totient is φ = 11051641466682.

The previous prime is 11051641466651. The next prime is 11051641466687. The reversal of 11051641466683 is 38666414615011.

It is a strong prime.

It is an emirp because it is prime and its reverse (38666414615011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11051641466683 - 25 = 11051641466651 is a prime.

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

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

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

Almost surely, 211051641466683 is an apocalyptic number.

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

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

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

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

The spelling of 11051641466683 in words is "eleven trillion, fifty-one billion, six hundred forty-one million, four hundred sixty-six thousand, six hundred eighty-three".