Search a number
-
+
220210021220369 is a prime number
BaseRepresentation
bin110010000100011110100100…
…000101110100000000010001
31001212200212120000001222201112
4302010132210011310000101
5212330410110413022434
62100203030455143105
764245435416266355
oct6204364405640021
91055625500058645
10220210021220369
116419060012a794
1220846216674a95
1395b493ca9bc7b
143c54316c4b465
151a6d27c049dce
hexc847a4174011

220210021220369 has 2 divisors, whose sum is σ = 220210021220370. Its totient is φ = 220210021220368.

The previous prime is 220210021220279. The next prime is 220210021220381. The reversal of 220210021220369 is 963022120012022.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 205405880032144 + 14804141188225 = 14331988^2 + 3847615^2 .

It is a cyclic number.

It is not a de Polignac number, because 220210021220369 - 240 = 219110509592593 is a prime.

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

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

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

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

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

Almost surely, 2220210021220369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10368, while the sum is 32.

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