Search a number
-
+
200012101011013 is a prime number
BaseRepresentation
bin101101011110100011110010…
…001110110100011001000101
3222020011222012012211002222111
4231132203302032310121011
5202203444240324323023
61545220142444101021
760062253214234144
oct5536436216643105
9866158165732874
10200012101011013
1158803723796aa5
121a523827b34771
13877b0a232c425
1437568ccc1775b
15181cb9161400d
hexb5e8f23b4645

200012101011013 has 2 divisors, whose sum is σ = 200012101011014. Its totient is φ = 200012101011012.

The previous prime is 200012101010999. The next prime is 200012101011097. The reversal of 200012101011013 is 310110101210002.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 199927666018084 + 84434992929 = 14139578^2 + 290577^2 .

It is a cyclic number.

It is not a de Polignac number, because 200012101011013 - 225 = 200012067456581 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2200012101011013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 200012101011013 its reverse (310110101210002), we get a palindrome (510122202221015).

The spelling of 200012101011013 in words is "two hundred trillion, twelve billion, one hundred one million, eleven thousand, thirteen".