Search a number
-
+
200021201120021 is a prime number
BaseRepresentation
bin101101011110101100010000…
…101000111110101100010101
3222020012211200102021112201212
4231132230100220332230111
5202204121404441320041
61545224245443031205
760063024554003201
oct5536542050765425
9866184612245655
10200021201120021
1158807573543646
121a52554766b505
13877bbc2760a08
14375711364bb01
15181d0254b78eb
hexb5eb10a3eb15

200021201120021 has 2 divisors, whose sum is σ = 200021201120022. Its totient is φ = 200021201120020.

The previous prime is 200021201119921. The next prime is 200021201120113. The reversal of 200021201120021 is 120021102120002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 199731230716900 + 289970403121 = 14132630^2 + 538489^2 .

It is a cyclic number.

It is not a de Polignac number, because 200021201120021 - 210 = 200021201118997 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2200021201120021 is an apocalyptic number.

It is an amenable number.

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

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

200021201120021 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 200021201120021 its reverse (120021102120002), we get a palindrome (320042303240023).

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