Base | Representation |
---|---|
bin | 1001110010111110101000… |
… | …1000100100001101110111 |
3 | 1102010201220011100200011220 |
4 | 2130233222020210031313 |
5 | 2402434322222000421 |
6 | 34524152402401423 |
7 | 2161131415620000 |
oct | 234575210441567 |
9 | 42121804320156 |
10 | 10771411125111 |
11 | 348314785198a |
12 | 125b6a3960273 |
13 | 6019801b5280 |
14 | 2934a66161a7 |
15 | 13a2c844c3c6 |
hex | 9cbea224377 |
10771411125111 has 40 divisors (see below), whose sum is σ = 18043341750000. Its totient is φ = 5681623401216.
The previous prime is 10771411125107. The next prime is 10771411125127. The reversal of 10771411125111 is 11152111417701.
It is not a de Polignac number, because 10771411125111 - 22 = 10771411125107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10771411127111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 57421986 + ... + 57609263.
It is an arithmetic number, because the mean of its divisors is an integer number (451083543750).
Almost surely, 210771411125111 is an apocalyptic number.
10771411125111 is a deficient number, since it is larger than the sum of its proper divisors (7271930624889).
10771411125111 is an equidigital number, since it uses as much as digits as its factorization.
10771411125111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115031293 (or 115031272 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 33.
The spelling of 10771411125111 in words is "ten trillion, seven hundred seventy-one billion, four hundred eleven million, one hundred twenty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •