Search a number
-
+
202200212011069 is a prime number
BaseRepresentation
bin101101111110011001100111…
…110011110111100000111101
3222111221011002102200212112201
4231332121213303313200331
5203000322013233323234
61554013254532431501
760406324514660626
oct5576314763674075
9874834072625481
10202200212011069
11594776a0371398
121a817909a78591
1388a9523a4374c
1437d07847c2a4d
151859a58e1e314
hexb7e667cf783d

202200212011069 has 2 divisors, whose sum is σ = 202200212011070. Its totient is φ = 202200212011068.

The previous prime is 202200212011019. The next prime is 202200212011211. The reversal of 202200212011069 is 960110212002202.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 158482593686169 + 43717618324900 = 12588987^2 + 6611930^2 .

It is a cyclic number.

It is not a de Polignac number, because 202200212011069 - 219 = 202200211486781 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (202200212011019) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101100106005534 + 101100106005535.

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

Almost surely, 2202200212011069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1728, while the sum is 28.

The spelling of 202200212011069 in words is "two hundred two trillion, two hundred billion, two hundred twelve million, eleven thousand, sixty-nine".