Search a number
-
+
11021323320031 is a prime number
BaseRepresentation
bin1010000001100001101000…
…0011111011101011011111
31110000121221222020120101011
42200120122003323223133
52421033132232220111
635235043120200051
72215156444335163
oct240303203735337
943017858216334
1011021323320031
11356a131763952
1212a000aa69027
1361c3ca01029b
142a16134ccca3
15141a536c0021
hexa061a0fbadf

11021323320031 has 2 divisors, whose sum is σ = 11021323320032. Its totient is φ = 11021323320030.

The previous prime is 11021323320019. The next prime is 11021323320047. The reversal of 11021323320031 is 13002332312011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11021323320031 - 233 = 11012733385439 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 11021323319984 and 11021323320011.

It is a congruent number.

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

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

Almost surely, 211021323320031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 22.

Adding to 11021323320031 its reverse (13002332312011), we get a palindrome (24023655632042).

The spelling of 11021323320031 in words is "eleven trillion, twenty-one billion, three hundred twenty-three million, three hundred twenty thousand, thirty-one".