Search a number
-
+
20131200013 is a prime number
BaseRepresentation
bin10010101111111010…
…011011110000001101
31220221222101220211111
4102233322123300031
5312212041400023
613125333252021
71311604243141
oct225772336015
956858356744
1020131200013
1185a05a0591
123a99a94011
131b8a923692
14d8d8b9221
157cc53500d
hex4afe9bc0d

20131200013 has 2 divisors, whose sum is σ = 20131200014. Its totient is φ = 20131200012.

The previous prime is 20131200007. The next prime is 20131200031. The reversal of 20131200013 is 31000213102.

Together with next prime (20131200031) 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., 19138508964 + 992691049 = 138342^2 + 31507^2 .

It is a cyclic number.

It is not a de Polignac number, because 20131200013 - 25 = 20131199981 is a prime.

It is a super-2 number, since 2×201312000132 (a number of 21 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

Almost surely, 220131200013 is an apocalyptic number.

It is an amenable number.

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

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

20131200013 is an evil number, because the sum of its binary digits is even.

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

Adding to 20131200013 its reverse (31000213102), we get a palindrome (51131413115).

The spelling of 20131200013 in words is "twenty billion, one hundred thirty-one million, two hundred thousand, thirteen".