Base | Representation |
---|---|
bin | 10010101110110101… |
… | …011011100101100001 |
3 | 1220220201100220220121 |
4 | 102232311123211201 |
5 | 312142424031033 |
6 | 13123445440241 |
7 | 1311264424504 |
oct | 225665334541 |
9 | 56821326817 |
10 | 20113111393 |
11 | 8591366311 |
12 | 3a93a10081 |
13 | 1b86c5c25b |
14 | d8b32b13b |
15 | 7cab6062d |
hex | 4aed5b961 |
20113111393 has 2 divisors, whose sum is σ = 20113111394. Its totient is φ = 20113111392.
The previous prime is 20113111303. The next prime is 20113111441. The reversal of 20113111393 is 39311131102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15122112784 + 4990998609 = 122972^2 + 70647^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20113111393 is a prime.
It is not a weakly prime, because it can be changed into another prime (20113111303) 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, 10056555696 + 10056555697.
It is an arithmetic number, because the mean of its divisors is an integer number (10056555697).
Almost surely, 220113111393 is an apocalyptic number.
It is an amenable number.
20113111393 is a deficient number, since it is larger than the sum of its proper divisors (1).
20113111393 is an equidigital number, since it uses as much as digits as its factorization.
20113111393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 25.
Adding to 20113111393 its reverse (39311131102), we get a palindrome (59424242495).
The spelling of 20113111393 in words is "twenty billion, one hundred thirteen million, one hundred eleven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •