Search a number
-
+
12213202331089 is a prime number
BaseRepresentation
bin1011000110111001101110…
…0101100010010111010001
31121020120102001212200211101
42301232123211202113101
53100100114244043324
641550400115544401
72400242352640504
oct261563345422721
947216361780741
1012213202331089
113989654355831
1214530008bb101
136a7913ca2a96
1430319d25713b
15162a60461944
hexb1b9b9625d1

12213202331089 has 2 divisors, whose sum is σ = 12213202331090. Its totient is φ = 12213202331088.

The previous prime is 12213202331087. The next prime is 12213202331123. The reversal of 12213202331089 is 98013320231221.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10044887180689 + 2168315150400 = 3169367^2 + 1472520^2 .

It is a cyclic number.

It is not a de Polignac number, because 12213202331089 - 21 = 12213202331087 is a prime.

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

Together with 12213202331087, it forms a pair of twin primes.

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

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

Almost surely, 212213202331089 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31104, while the sum is 37.

The spelling of 12213202331089 in words is "twelve trillion, two hundred thirteen billion, two hundred two million, three hundred thirty-one thousand, eighty-nine".