Search a number
-
+
11501322641 is a prime number
BaseRepresentation
bin10101011011000100…
…00100000110010001
31002200112202201121122
422231202010012101
5142023314311031
65141133132025
7555004425614
oct125542040621
932615681548
1011501322641
114972218a26
12228b92a015
131113a53773
147b16cc17b
15474ab947b
hex2ad884191

11501322641 has 2 divisors, whose sum is σ = 11501322642. Its totient is φ = 11501322640.

The previous prime is 11501322619. The next prime is 11501322667. The reversal of 11501322641 is 14622310511.

It is an a-pointer prime, because the next prime (11501322667) can be obtained adding 11501322641 to its sum of digits (26).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11432100241 + 69222400 = 106921^2 + 8320^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 211501322641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1440, while the sum is 26.

The spelling of 11501322641 in words is "eleven billion, five hundred one million, three hundred twenty-two thousand, six hundred forty-one".