Search a number
-
+
11981822113 is a prime number
BaseRepresentation
bin10110010100010110…
…00001100010100001
31010221000220121222101
423022023001202201
5144014321301423
65300540010401
7602630543662
oct131213014241
933830817871
1011981822113
115099476328
1223a4830a01
13118c46b891
14819449369
154a1d7e7ad
hex2ca2c18a1

11981822113 has 2 divisors, whose sum is σ = 11981822114. Its totient is φ = 11981822112.

The previous prime is 11981822089. The next prime is 11981822131. The reversal of 11981822113 is 31122818911.

Together with next prime (11981822131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8228666944 + 3753155169 = 90712^2 + 61263^2 .

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

It is a cyclic number.

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

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

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

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

Almost surely, 211981822113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 6912, while the sum is 37.

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