Base | Representation |
---|---|
bin | 10010101110101110… |
… | …001110000011001001 |
3 | 1220220120210212200201 |
4 | 102232232032003021 |
5 | 312141433032222 |
6 | 13123341132201 |
7 | 1311242362123 |
oct | 225656160311 |
9 | 56816725621 |
10 | 20111220937 |
11 | 8590294a55 |
12 | 3a9325a061 |
13 | 1b86749942 |
14 | d8ad98213 |
15 | 7ca8da427 |
hex | 4aeb8e0c9 |
20111220937 has 2 divisors, whose sum is σ = 20111220938. Its totient is φ = 20111220936.
The previous prime is 20111220931. The next prime is 20111221003. The reversal of 20111220937 is 73902211102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18449517241 + 1661703696 = 135829^2 + 40764^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111220937 - 23 = 20111220929 is a prime.
It is a super-2 number, since 2×201112209372 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20111220931) 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, 10055610468 + 10055610469.
It is an arithmetic number, because the mean of its divisors is an integer number (10055610469).
Almost surely, 220111220937 is an apocalyptic number.
It is an amenable number.
20111220937 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111220937 is an equidigital number, since it uses as much as digits as its factorization.
20111220937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
The spelling of 20111220937 in words is "twenty billion, one hundred eleven million, two hundred twenty thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •