Search a number
-
+
220010000012141 is a prime number
BaseRepresentation
bin110010000001100100010001…
…111001011101001101101101
31001211222202021011212211000012
4302001210101321131031231
5212314120440000342031
62055531110530343005
764225124620131653
oct6201442171351555
91054882234784005
10220010000012141
11641137983a3529
12208134b3a2aa65
13959bb14265761
143c48780008dd3
151a67e71cd6b2b
hexc81911e5d36d

220010000012141 has 2 divisors, whose sum is σ = 220010000012142. Its totient is φ = 220010000012140.

The previous prime is 220010000012087. The next prime is 220010000012167. The reversal of 220010000012141 is 141210000010022.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 124994859612100 + 95015140400041 = 11180110^2 + 9747571^2 .

It is a cyclic number.

It is not a de Polignac number, because 220010000012141 - 234 = 219992820142957 is a prime.

It is a congruent number.

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

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

Almost surely, 2220010000012141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 220010000012141 its reverse (141210000010022), we get a palindrome (361220000022163).

The spelling of 220010000012141 in words is "two hundred twenty trillion, ten billion, twelve thousand, one hundred forty-one".