Base | Representation |
---|---|
bin | 10010101110101001… |
… | …111101000111000011 |
3 | 1220220111201002010212 |
4 | 102232221331013003 |
5 | 312141141243404 |
6 | 13123301144335 |
7 | 1311230024561 |
oct | 225651750703 |
9 | 56814632125 |
10 | 20110102979 |
11 | 858a6a101a |
12 | 3a929bb0ab |
13 | 1b86447b25 |
14 | d8ab86a31 |
15 | 7ca76906e |
hex | 4aea7d1c3 |
20110102979 has 2 divisors, whose sum is σ = 20110102980. Its totient is φ = 20110102978.
The previous prime is 20110102933. The next prime is 20110102993. The reversal of 20110102979 is 97920101102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20110102979 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (20110102079) 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, 10055051489 + 10055051490.
It is an arithmetic number, because the mean of its divisors is an integer number (10055051490).
Almost surely, 220110102979 is an apocalyptic number.
20110102979 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110102979 is an equidigital number, since it uses as much as digits as its factorization.
20110102979 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 32.
The spelling of 20110102979 in words is "twenty billion, one hundred ten million, one hundred two thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •