Search a number
-
+
20000936513 is a prime number
BaseRepresentation
bin10010101000001001…
…100001001001000001
31220121220021211220102
4102220021201021001
5311430214432023
613104401252145
71305433104155
oct225011411101
956556254812
1020000936513
1185340096a8
123a62334055
131b69944c9c
14d7a48b065
157c0da3628
hex4a8261241

20000936513 has 2 divisors, whose sum is σ = 20000936514. Its totient is φ = 20000936512.

The previous prime is 20000936489. The next prime is 20000936591. The reversal of 20000936513 is 31563900002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 14292680704 + 5708255809 = 119552^2 + 75553^2 .

It is a cyclic number.

It is not a de Polignac number, because 20000936513 - 216 = 20000870977 is a prime.

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

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

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

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

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

Almost surely, 220000936513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4860, while the sum is 29.

The spelling of 20000936513 in words is "twenty billion, nine hundred thirty-six thousand, five hundred thirteen".