Base | Representation |
---|---|
bin | 10010101110110000… |
… | …000011101010111001 |
3 | 1220220121201100120021 |
4 | 102232300003222321 |
5 | 312142043441323 |
6 | 13123355330441 |
7 | 1311246436534 |
oct | 225660035271 |
9 | 56817640507 |
10 | 20111702713 |
11 | 8590593a13 |
12 | 3a93450a21 |
13 | 1b8688800b |
14 | d8b081a1b |
15 | 7ca98305d |
hex | 4aec03ab9 |
20111702713 has 2 divisors, whose sum is σ = 20111702714. Its totient is φ = 20111702712.
The previous prime is 20111702701. The next prime is 20111702719. The reversal of 20111702713 is 31720711102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16477059769 + 3634642944 = 128363^2 + 60288^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111702713 - 213 = 20111694521 is a prime.
It is not a weakly prime, because it can be changed into another prime (20111702719) 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, 10055851356 + 10055851357.
It is an arithmetic number, because the mean of its divisors is an integer number (10055851357).
Almost surely, 220111702713 is an apocalyptic number.
It is an amenable number.
20111702713 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111702713 is an equidigital number, since it uses as much as digits as its factorization.
20111702713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 588, while the sum is 25.
The spelling of 20111702713 in words is "twenty billion, one hundred eleven million, seven hundred two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •