Base | Representation |
---|---|
bin | 10100101101100111… |
… | …11000000101011001 |
3 | 1001200222110102111021 |
4 | 22112303320011121 |
5 | 140233222203212 |
6 | 5035234402441 |
7 | 542365266301 |
oct | 122663700531 |
9 | 31628412437 |
10 | 11120116057 |
11 | 4797019866 |
12 | 21a4130421 |
13 | 1082a9233b |
14 | 776c1a601 |
15 | 4513b9307 |
hex | 296cf8159 |
11120116057 has 2 divisors, whose sum is σ = 11120116058. Its totient is φ = 11120116056.
The previous prime is 11120116043. The next prime is 11120116067. The reversal of 11120116057 is 75061102111.
11120116057 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 can be written as a sum of positive squares in only one way, i.e., 8125399881 + 2994716176 = 90141^2 + 54724^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120116057 - 211 = 11120114009 is a prime.
It is a super-2 number, since 2×111201160572 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11120116067) 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, 5560058028 + 5560058029.
It is an arithmetic number, because the mean of its divisors is an integer number (5560058029).
Almost surely, 211120116057 is an apocalyptic number.
It is an amenable number.
11120116057 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120116057 is an equidigital number, since it uses as much as digits as its factorization.
11120116057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 420, while the sum is 25.
Adding to 11120116057 its reverse (75061102111), we get a palindrome (86181218168).
The spelling of 11120116057 in words is "eleven billion, one hundred twenty million, one hundred sixteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •