Search a number
-
+
11811962081 is a prime number
BaseRepresentation
bin10110000000000110…
…00011110011100001
31010111012021211211002
423000003003303201
5143142330241311
65232031201345
7565466010143
oct130003036341
933435254732
1011811962081
1150115a9a37
122357976255
13116320819a
14800a70c93
15491eca93b
hex2c00c3ce1

11811962081 has 2 divisors, whose sum is σ = 11811962082. Its totient is φ = 11811962080.

The previous prime is 11811962069. The next prime is 11811962119. The reversal of 11811962081 is 18026911811.

It is an a-pointer prime, because the next prime (11811962119) can be obtained adding 11811962081 to its sum of digits (38).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11556250000 + 255712081 = 107500^2 + 15991^2 .

It is a cyclic number.

It is not a de Polignac number, because 11811962081 - 26 = 11811962017 is a prime.

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

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

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

Almost surely, 211811962081 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6912, while the sum is 38.

The spelling of 11811962081 in words is "eleven billion, eight hundred eleven million, nine hundred sixty-two thousand, eighty-one".