Search a number
-
+
203122101341 is a prime number
BaseRepresentation
bin1011110100101100000…
…1010100110001011101
3201102021221001212101102
42331023001110301131
511311443224220331
6233151335322445
720450361242165
oct2751301246135
9642257055342
10203122101341
1179164149145
1233449220425
13162010b4c13
149b8c9cd5a5
15543c5d64cb
hex2f4b054c5d

203122101341 has 2 divisors, whose sum is σ = 203122101342. Its totient is φ = 203122101340.

The previous prime is 203122101331. The next prime is 203122101349. The reversal of 203122101341 is 143101221302.

203122101341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 166501538116 + 36620563225 = 408046^2 + 191365^2 .

It is a cyclic number.

It is not a de Polignac number, because 203122101341 - 222 = 203117907037 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2203122101341 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 288, while the sum is 20.

Adding to 203122101341 its reverse (143101221302), we get a palindrome (346223322643).

The spelling of 203122101341 in words is "two hundred three billion, one hundred twenty-two million, one hundred one thousand, three hundred forty-one".