Search a number
-
+
11006464641071 is a prime number
BaseRepresentation
bin1010000000101010010001…
…1010100100100000101111
31102222012121110000110201012
42200022210122210200233
52420312214422003241
635224144451135435
72214122311550354
oct240124432444057
942865543013635
1011006464641071
1135638a7396489
1212991628a457b
1361ab9c844963
142a0a03d7462b
15141483ec36eb
hexa02a46a482f

11006464641071 has 2 divisors, whose sum is σ = 11006464641072. Its totient is φ = 11006464641070.

The previous prime is 11006464641049. The next prime is 11006464641089. The reversal of 11006464641071 is 17014646460011.

It is a strong prime.

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

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 211006464641071 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 96768, while the sum is 41.

The spelling of 11006464641071 in words is "eleven trillion, six billion, four hundred sixty-four million, six hundred forty-one thousand, seventy-one".