Base | Representation |
---|---|
bin | 10010101110110001… |
… | …001100001111111001 |
3 | 1220220122021110100122 |
4 | 102232301030033321 |
5 | 312142132444433 |
6 | 13123405543025 |
7 | 1311252115331 |
oct | 225661141771 |
9 | 56818243318 |
10 | 20111999993 |
11 | 85907772a8 |
12 | 3a93574a75 |
13 | 1b86960417 |
14 | d8b11c0c1 |
15 | 7ca9e1198 |
hex | 4aec4c3f9 |
20111999993 has 2 divisors, whose sum is σ = 20111999994. Its totient is φ = 20111999992.
The previous prime is 20111999987. The next prime is 20112000001. The reversal of 20111999993 is 39999911102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14710778944 + 5401221049 = 121288^2 + 73493^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111999993 - 210 = 20111998969 is a prime.
It is not a weakly prime, because it can be changed into another prime (20111999893) 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, 10055999996 + 10055999997.
It is an arithmetic number, because the mean of its divisors is an integer number (10055999997).
Almost surely, 220111999993 is an apocalyptic number.
It is an amenable number.
20111999993 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111999993 is an equidigital number, since it uses as much as digits as its factorization.
20111999993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 354294, while the sum is 53.
The spelling of 20111999993 in words is "twenty billion, one hundred eleven million, nine hundred ninety-nine thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •