Search a number
-
+
200332102371013 is a prime number
BaseRepresentation
bin101101100011001101110011…
…110011001000011011000101
3222021022120011122211111112201
4231203031303303020123011
5202224220121201333023
61550023144115514501
760124342152016444
oct5543156363103305
9867276148744481
10200332102371013
1158917405161088
121a5758538b8a31
1387a230bbc09a2
1437681a84b6d5b
15182616ec0bbad
hexb63373cc86c5

200332102371013 has 2 divisors, whose sum is σ = 200332102371014. Its totient is φ = 200332102371012.

The previous prime is 200332102371007. The next prime is 200332102371019. The reversal of 200332102371013 is 310173201233002.

It is a happy number.

It is a balanced prime because it is at equal distance from previous prime (200332102371007) and next prime (200332102371019).

It can be written as a sum of positive squares in only one way, i.e., 200225273409604 + 106828961409 = 14150098^2 + 326847^2 .

It is a cyclic number.

It is not a de Polignac number, because 200332102371013 - 29 = 200332102370501 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2200332102371013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4536, while the sum is 28.

The spelling of 200332102371013 in words is "two hundred trillion, three hundred thirty-two billion, one hundred two million, three hundred seventy-one thousand, thirteen".