Search a number
-
+
203311001110201 is a prime number
BaseRepresentation
bin101110001110100100001000…
…000000000000011010111001
3222122212100020020100122220121
4232032210020000000122321
5203122021412241011301
62000223441242053241
760552510065352655
oct5616441000003271
9878770206318817
10203311001110201
1159865790902236
121a97704aaaa221
13895a1b6b4343a
14382c43ab3ba65
1518788bbba03a1
hexb8e9080006b9

203311001110201 has 2 divisors, whose sum is σ = 203311001110202. Its totient is φ = 203311001110200.

The previous prime is 203311001110159. The next prime is 203311001110223. The reversal of 203311001110201 is 102011100113302.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 163442826594576 + 39868174515625 = 12784476^2 + 6314125^2 .

It is a cyclic number.

It is not a de Polignac number, because 203311001110201 - 213 = 203311001102009 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2203311001110201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 203311001110201 its reverse (102011100113302), we get a palindrome (305322101223503).

The spelling of 203311001110201 in words is "two hundred three trillion, three hundred eleven billion, one million, one hundred ten thousand, two hundred one".