Search a number
-
+
2220221011013 is a prime number
BaseRepresentation
bin100000010011101111011…
…111000001010001000101
321212020210000112022211022
4200103233133001101011
5242334003034323023
64415542213320525
7316256101132655
oct40235737012105
97766700468738
102220221011013
11786654974935
122ba363636145
1313149ac90b05
1479660348365
153cb467c77c8
hex204ef7c1445

2220221011013 has 2 divisors, whose sum is σ = 2220221011014. Its totient is φ = 2220221011012.

The previous prime is 2220221010991. The next prime is 2220221011081. The reversal of 2220221011013 is 3101101220222.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2205931916644 + 14289094369 = 1485238^2 + 119537^2 .

It is a cyclic number.

It is not a de Polignac number, because 2220221011013 - 232 = 2215926043717 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 22220221011013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 96, while the sum is 17.

Adding to 2220221011013 its reverse (3101101220222), we get a palindrome (5321322231235).

The spelling of 2220221011013 in words is "two trillion, two hundred twenty billion, two hundred twenty-one million, eleven thousand, thirteen".