Base | Representation |
---|---|
bin | 11110100100110100100… |
… | …010101000010101000001 |
3 | 21102212100200220112200221 |
4 | 132210310202220111001 |
5 | 233411043322013212 |
6 | 4245124052143041 |
7 | 304541503403344 |
oct | 36446442502501 |
9 | 7385320815627 |
10 | 2101120501057 |
11 | 740097823a16 |
12 | 29b265007a81 |
13 | 12319a251c96 |
14 | 739a266845b |
15 | 399c579c807 |
hex | 1e9348a8541 |
2101120501057 has 2 divisors, whose sum is σ = 2101120501058. Its totient is φ = 2101120501056.
The previous prime is 2101120501043. The next prime is 2101120501063. The reversal of 2101120501057 is 7501050211012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1821854757121 + 279265743936 = 1349761^2 + 528456^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101120501057 - 27 = 2101120500929 is a prime.
It is not a weakly prime, because it can be changed into another prime (2101120501757) 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, 1050560250528 + 1050560250529.
It is an arithmetic number, because the mean of its divisors is an integer number (1050560250529).
Almost surely, 22101120501057 is an apocalyptic number.
It is an amenable number.
2101120501057 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101120501057 is an equidigital number, since it uses as much as digits as its factorization.
2101120501057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 700, while the sum is 25.
Adding to 2101120501057 its reverse (7501050211012), we get a palindrome (9602170712069).
The spelling of 2101120501057 in words is "two trillion, one hundred one billion, one hundred twenty million, five hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •