Base | Representation |
---|---|
bin | 10010101000110111… |
… | …110111000000110111 |
3 | 1220122202011001010021 |
4 | 102220313313000313 |
5 | 311441322202402 |
6 | 13105513510011 |
7 | 1305641261536 |
oct | 225067670067 |
9 | 56582131107 |
10 | 20013084727 |
11 | 853a956849 |
12 | 3a66412307 |
13 | 1b6c30958c |
14 | d7bd3031d |
15 | 7c1ea2d37 |
hex | 4a8df7037 |
20013084727 has 2 divisors, whose sum is σ = 20013084728. Its totient is φ = 20013084726.
The previous prime is 20013084661. The next prime is 20013084739. The reversal of 20013084727 is 72748031002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20013084727 - 223 = 20004696119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20013084692 and 20013084701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20013084757) 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, 10006542363 + 10006542364.
It is an arithmetic number, because the mean of its divisors is an integer number (10006542364).
Almost surely, 220013084727 is an apocalyptic number.
20013084727 is a deficient number, since it is larger than the sum of its proper divisors (1).
20013084727 is an equidigital number, since it uses as much as digits as its factorization.
20013084727 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18816, while the sum is 34.
The spelling of 20013084727 in words is "twenty billion, thirteen million, eighty-four thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •