Base | Representation |
---|---|
bin | 1010000001000000000110… |
… | …0010101010101110101101 |
3 | 1102222202201122200202012002 |
4 | 2200100001202222232231 |
5 | 2420411213413341302 |
6 | 35230554011022045 |
7 | 2214420414435641 |
oct | 240200142525655 |
9 | 42882648622162 |
10 | 11012322012077 |
11 | 3566332759a71 |
12 | 129a31843a925 |
13 | 61b5c41c2869 |
14 | 2a0ddbc56c21 |
15 | 1416c8335c02 |
hex | a04018aabad |
11012322012077 has 2 divisors, whose sum is σ = 11012322012078. Its totient is φ = 11012322012076.
The previous prime is 11012322012059. The next prime is 11012322012121. The reversal of 11012322012077 is 77021022321011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9828688985476 + 1183633026601 = 3135074^2 + 1087949^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11012322012077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012322015077) 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, 5506161006038 + 5506161006039.
It is an arithmetic number, because the mean of its divisors is an integer number (5506161006039).
Almost surely, 211012322012077 is an apocalyptic number.
It is an amenable number.
11012322012077 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012322012077 is an equidigital number, since it uses as much as digits as its factorization.
11012322012077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2352, while the sum is 29.
Adding to 11012322012077 its reverse (77021022321011), we get a palindrome (88033344333088).
The spelling of 11012322012077 in words is "eleven trillion, twelve billion, three hundred twenty-two million, twelve thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •