Search a number
-
+
200032311113 is a prime number
BaseRepresentation
bin1011101001001011011…
…0101101011101001001
3201010022121002021000022
42322102312231131021
511234131232423423
6231521002350225
720310662406335
oct2722266553511
9633277067008
10200032311113
117791902aaa8
12329264bb375
1315b2ac2308b
1499784d27c5
15530b207dc8
hex2e92dad749

200032311113 has 2 divisors, whose sum is σ = 200032311114. Its totient is φ = 200032311112.

The previous prime is 200032311103. The next prime is 200032311131. The reversal of 200032311113 is 311113230002.

Together with next prime (200032311131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 192850087609 + 7182223504 = 439147^2 + 84748^2 .

It is a cyclic number.

It is not a de Polignac number, because 200032311113 - 220 = 200031262537 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2200032311113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 17.

Adding to 200032311113 its reverse (311113230002), we get a palindrome (511145541115).

The spelling of 200032311113 in words is "two hundred billion, thirty-two million, three hundred eleven thousand, one hundred thirteen".