Base | Representation |
---|---|
bin | 1010000001111100110001… |
… | …1100011011111110111111 |
3 | 1110001022202212101220002112 |
4 | 2200133030130123332333 |
5 | 2421143043412234201 |
6 | 35242250213444235 |
7 | 2215535156143415 |
oct | 240371434337677 |
9 | 43038685356075 |
10 | 11028611055551 |
11 | 3572231475471 |
12 | 12a150364067b |
13 | 61ccbbb0b81b |
14 | 2a1b053492b5 |
15 | 141d2d3c40bb |
hex | a07cc71bfbf |
11028611055551 has 2 divisors, whose sum is σ = 11028611055552. Its totient is φ = 11028611055550.
The previous prime is 11028611055461. The next prime is 11028611055557. The reversal of 11028611055551 is 15555011682011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11028611055551 - 226 = 11028543946687 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11028611055499 and 11028611055508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11028611055557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5514305527775 + 5514305527776.
It is an arithmetic number, because the mean of its divisors is an integer number (5514305527776).
Almost surely, 211028611055551 is an apocalyptic number.
11028611055551 is a deficient number, since it is larger than the sum of its proper divisors (1).
11028611055551 is an equidigital number, since it uses as much as digits as its factorization.
11028611055551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60000, while the sum is 41.
The spelling of 11028611055551 in words is "eleven trillion, twenty-eight billion, six hundred eleven million, fifty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •