Search a number
-
+
2131102322269 is a prime number
BaseRepresentation
bin11111000000101111100…
…110001100111001011101
321112201202011222212110121
4133000233212030321131
5234403444143303034
64311003114434541
7306652462566664
oct37005746147135
97481664885417
102131102322269
11751882780a58
122a5031a32a51
13125c679208ab
14752084ddddb
153a67c9d51b4
hex1f02f98ce5d

2131102322269 has 2 divisors, whose sum is σ = 2131102322270. Its totient is φ = 2131102322268.

The previous prime is 2131102322267. The next prime is 2131102322273. The reversal of 2131102322269 is 9622232011312.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2070038970169 + 61063352100 = 1438763^2 + 247110^2 .

It is a cyclic number.

It is not a de Polignac number, because 2131102322269 - 21 = 2131102322267 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 22131102322269 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15552, while the sum is 34.

The spelling of 2131102322269 in words is "two trillion, one hundred thirty-one billion, one hundred two million, three hundred twenty-two thousand, two hundred sixty-nine".