Search a number
-
+
200010102210013 is a prime number
BaseRepresentation
bin101101011110100001111011…
…000101111111110111011101
3222020011210000220201111110211
4231132201323011333313131
5202203431142131210023
61545215212242532421
760062152533555034
oct5536417305776735
9866153026644424
10200010102210013
1158802898499247
121a52336a667111
13877ab441b4a44
14375677d59171b
15181cac5ddba0d
hexb5e87b17fddd

200010102210013 has 2 divisors, whose sum is σ = 200010102210014. Its totient is φ = 200010102210012.

The previous prime is 200010102209993. The next prime is 200010102210019. The reversal of 200010102210013 is 310012201010002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 156857263887289 + 43152838322724 = 12524267^2 + 6569082^2 .

It is a cyclic number.

It is not a de Polignac number, because 200010102210013 - 221 = 200010100112861 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2200010102210013 is an apocalyptic number.

It is an amenable number.

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

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

200010102210013 is an evil number, because the sum of its binary digits is even.

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

Adding to 200010102210013 its reverse (310012201010002), we get a palindrome (510022303220015).

The spelling of 200010102210013 in words is "two hundred trillion, ten billion, one hundred two million, two hundred ten thousand, thirteen".