Base | Representation |
---|---|
bin | 11010001001111100000110… |
… | …11011101001000010011011 |
3 | 21112122111010202010120001022 |
4 | 31010332003123221002123 |
5 | 30014320444200401021 |
6 | 322154312004513055 |
7 | 15054254606351444 |
oct | 1504760333510233 |
9 | 245574122116038 |
10 | 57516112122011 |
11 | 1736549a93a644 |
12 | 654b0116ab78b |
13 | 261299124b77a |
14 | 102bb1a8602cb |
15 | 69b1d57341ab |
hex | 344f836e909b |
57516112122011 has 2 divisors, whose sum is σ = 57516112122012. Its totient is φ = 57516112122010.
The previous prime is 57516112121981. The next prime is 57516112122031. The reversal of 57516112122011 is 11022121161575.
57516112122011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 57516112122011 - 218 = 57516111859867 is a prime.
It is not a weakly prime, because it can be changed into another prime (57516112122031) 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, 28758056061005 + 28758056061006.
It is an arithmetic number, because the mean of its divisors is an integer number (28758056061006).
Almost surely, 257516112122011 is an apocalyptic number.
57516112122011 is a deficient number, since it is larger than the sum of its proper divisors (1).
57516112122011 is an equidigital number, since it uses as much as digits as its factorization.
57516112122011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8400, while the sum is 35.
Adding to 57516112122011 its reverse (11022121161575), we get a palindrome (68538233283586).
The spelling of 57516112122011 in words is "fifty-seven trillion, five hundred sixteen billion, one hundred twelve million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •