Base | Representation |
---|---|
bin | 11010001001111100000110… |
… | …11011101001000100001111 |
3 | 21112122111010202010120012121 |
4 | 31010332003123221010033 |
5 | 30014320444200402002 |
6 | 322154312004513411 |
7 | 15054254606352001 |
oct | 1504760333510417 |
9 | 245574122116177 |
10 | 57516112122127 |
11 | 1736549a93a73a |
12 | 654b0116ab867 |
13 | 261299124b839 |
14 | 102bb1a860371 |
15 | 69b1d5734237 |
hex | 344f836e910f |
57516112122127 has 16 divisors (see below), whose sum is σ = 60253540098048. Its totient is φ = 54798470657920.
The previous prime is 57516112122101. The next prime is 57516112122137. The reversal of 57516112122127 is 72122121161575.
57516112122127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 57516112122127 - 223 = 57516103733519 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57516112122137) 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 in 15 ways as a sum of consecutive naturals, for example, 42296727 + ... + 43635367.
It is an arithmetic number, because the mean of its divisors is an integer number (3765846256128).
Almost surely, 257516112122127 is an apocalyptic number.
57516112122127 is a deficient number, since it is larger than the sum of its proper divisors (2737427975921).
57516112122127 is a wasteful number, since it uses less digits than its factorization.
57516112122127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1346030.
The product of its digits is 117600, while the sum is 43.
The spelling of 57516112122127 in words is "fifty-seven trillion, five hundred sixteen billion, one hundred twelve million, one hundred twenty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •