Search a number
-
+
200011410330929 is a prime number
BaseRepresentation
bin101101011110100011001001…
…000100000101010100110001
3222020011220102002011221000122
4231132203021010011110301
5202203441332021042204
61545215550132300025
760062230126450451
oct5536431104052461
9866156362157018
10200011410330929
11588033a993290a
121a523674771615
13877acc22041a2
1437568651c7d61
15181cb50b830be
hexb5e8c9105531

200011410330929 has 2 divisors, whose sum is σ = 200011410330930. Its totient is φ = 200011410330928.

The previous prime is 200011410330917. The next prime is 200011410331037. The reversal of 200011410330929 is 929033014110002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 122933809352704 + 77077600978225 = 11087552^2 + 8779385^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-200011410330929 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2200011410330929 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 35.

The spelling of 200011410330929 in words is "two hundred trillion, eleven billion, four hundred ten million, three hundred thirty thousand, nine hundred twenty-nine".