Base | Representation |
---|---|
bin | 1010000111010001010011… |
… | …1101100011111100101001 |
3 | 1110101001201110020121011121 |
4 | 2201310110331203330221 |
5 | 2424142301113333224 |
6 | 35352244555455241 |
7 | 2225252340353623 |
oct | 241642475437451 |
9 | 43331643217147 |
10 | 11120022011689 |
11 | 35a7a7a588808 |
12 | 12b7174a57521 |
13 | 6287c9047396 |
14 | 2a62d77abc13 |
15 | 1443cd55bbe4 |
hex | a1d14f63f29 |
11120022011689 has 2 divisors, whose sum is σ = 11120022011690. Its totient is φ = 11120022011688.
The previous prime is 11120022011653. The next prime is 11120022011701. The reversal of 11120022011689 is 98611022002111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11084105318400 + 35916693289 = 3329280^2 + 189517^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120022011689 - 27 = 11120022011561 is a prime.
It is not a weakly prime, because it can be changed into another prime (11120022011629) 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 as a sum of consecutive naturals, namely, 5560011005844 + 5560011005845.
It is an arithmetic number, because the mean of its divisors is an integer number (5560011005845).
Almost surely, 211120022011689 is an apocalyptic number.
It is an amenable number.
11120022011689 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120022011689 is an equidigital number, since it uses as much as digits as its factorization.
11120022011689 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 34.
The spelling of 11120022011689 in words is "eleven trillion, one hundred twenty billion, twenty-two million, eleven thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •