Base | Representation |
---|---|
bin | 10010101000110100… |
… | …011111010010011001 |
3 | 1220122200111011000211 |
4 | 102220310133102121 |
5 | 311441110413423 |
6 | 13105442531121 |
7 | 1305630621442 |
oct | 225064372231 |
9 | 56580434024 |
10 | 20012201113 |
11 | 853a402993 |
12 | 3a66066aa1 |
13 | 1b6c08a328 |
14 | d7bb802c9 |
15 | 7c1d7b10d |
hex | 4a8d1f499 |
20012201113 has 2 divisors, whose sum is σ = 20012201114. Its totient is φ = 20012201112.
The previous prime is 20012201081. The next prime is 20012201189. The reversal of 20012201113 is 31110221002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17612474944 + 2399726169 = 132712^2 + 48987^2 .
It is a cyclic number.
It is not a de Polignac number, because 20012201113 - 25 = 20012201081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20012201093 and 20012201102.
It is not a weakly prime, because it can be changed into another prime (20012202113) 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, 10006100556 + 10006100557.
It is an arithmetic number, because the mean of its divisors is an integer number (10006100557).
Almost surely, 220012201113 is an apocalyptic number.
It is an amenable number.
20012201113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20012201113 is an equidigital number, since it uses as much as digits as its factorization.
20012201113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 20012201113 its reverse (31110221002), we get a palindrome (51122422115).
The spelling of 20012201113 in words is "twenty billion, twelve million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •