Base | Representation |
---|---|
bin | 10010101110101101… |
… | …010001000000011111 |
3 | 1220220120100011201111 |
4 | 102232231101000133 |
5 | 312141402032121 |
6 | 13123331522451 |
7 | 1311240301153 |
oct | 225655210037 |
9 | 56816304644 |
10 | 20110970911 |
11 | 8590134119 |
12 | 3a93159427 |
13 | 1b8668cbb5 |
14 | d8ad31063 |
15 | 7ca88b2e1 |
hex | 4aeb5101f |
20110970911 has 2 divisors, whose sum is σ = 20110970912. Its totient is φ = 20110970910.
The previous prime is 20110970849. The next prime is 20110970923. The reversal of 20110970911 is 11907901102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20110970911 - 215 = 20110938143 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110940911) 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, 10055485455 + 10055485456.
It is an arithmetic number, because the mean of its divisors is an integer number (10055485456).
Almost surely, 220110970911 is an apocalyptic number.
20110970911 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110970911 is an equidigital number, since it uses as much as digits as its factorization.
20110970911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 31.
The spelling of 20110970911 in words is "twenty billion, one hundred ten million, nine hundred seventy thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •