Search a number
-
+
20110230313 is a prime number
BaseRepresentation
bin10010101110101010…
…011100001100101001
31220220111221112210221
4102232222130030221
5312141204332223
613123304010041
71311231065035
oct225652341451
956814845727
1020110230313
11858a778758
123a92a60921
131b86490a84
14d8abbb1c5
157ca791b5d
hex4aea9c329

20110230313 has 2 divisors, whose sum is σ = 20110230314. Its totient is φ = 20110230312.

The previous prime is 20110230263. The next prime is 20110230331. The reversal of 20110230313 is 31303201102.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19431523609 + 678706704 = 139397^2 + 26052^2 .

It is a cyclic number.

It is not a de Polignac number, because 20110230313 - 29 = 20110229801 is a prime.

It is not a weakly prime, because it can be changed into another prime (20110240313) 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, 10055115156 + 10055115157.

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

Almost surely, 220110230313 is an apocalyptic number.

It is an amenable number.

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

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

20110230313 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 16.

Adding to 20110230313 its reverse (31303201102), we get a palindrome (51413431415).

The spelling of 20110230313 in words is "twenty billion, one hundred ten million, two hundred thirty thousand, three hundred thirteen".