Base | Representation |
---|---|
bin | 1010000001011100110010… |
… | …0000001111111001111001 |
3 | 1110000111121021210202120112 |
4 | 2200113030200033321321 |
5 | 2421023001130320212 |
6 | 35234310035034105 |
7 | 2215112264326226 |
oct | 240271440177171 |
9 | 43014537722515 |
10 | 11020022120057 |
11 | 3569624217075 |
12 | 129b90713b935 |
13 | 61c250575082 |
14 | 2a152c77894d |
15 | 1419c9344422 |
hex | a05cc80fe79 |
11020022120057 has 2 divisors, whose sum is σ = 11020022120058. Its totient is φ = 11020022120056.
The previous prime is 11020022119987. The next prime is 11020022120099. The reversal of 11020022120057 is 75002122002011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7832408238736 + 3187613881321 = 2798644^2 + 1785389^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020022120057 - 226 = 11019955011193 is a prime.
It is not a weakly prime, because it can be changed into another prime (11020022920057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510011060028 + 5510011060029.
It is an arithmetic number, because the mean of its divisors is an integer number (5510011060029).
Almost surely, 211020022120057 is an apocalyptic number.
It is an amenable number.
11020022120057 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020022120057 is an equidigital number, since it uses as much as digits as its factorization.
11020022120057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 11020022120057 its reverse (75002122002011), we get a palindrome (86022144122068).
The spelling of 11020022120057 in words is "eleven trillion, twenty billion, twenty-two million, one hundred twenty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •