Base | Representation |
---|---|
bin | 11101000111101100000… |
… | …110111001000001101001 |
3 | 21002022020120020200010112 |
4 | 131013230012321001221 |
5 | 230241243440201212 |
6 | 4131145144224105 |
7 | 264401434014653 |
oct | 35075406710151 |
9 | 7068216220115 |
10 | 2001121022057 |
11 | 7017417142a3 |
12 | 2839b746b035 |
13 | 116921895731 |
14 | 6cbd77016d3 |
15 | 370c1617422 |
hex | 1d1ec1b9069 |
2001121022057 has 2 divisors, whose sum is σ = 2001121022058. Its totient is φ = 2001121022056.
The previous prime is 2001121022029. The next prime is 2001121022059. The reversal of 2001121022057 is 7502201211002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1369674649561 + 631446372496 = 1170331^2 + 794636^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2001121022057 is a prime.
It is a super-2 number, since 2×20011210220572 (a number of 25 digits) contains 22 as substring.
Together with 2001121022059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2001121022059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000560511028 + 1000560511029.
It is an arithmetic number, because the mean of its divisors is an integer number (1000560511029).
Almost surely, 22001121022057 is an apocalyptic number.
It is an amenable number.
2001121022057 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001121022057 is an equidigital number, since it uses as much as digits as its factorization.
2001121022057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 2001121022057 its reverse (7502201211002), we get a palindrome (9503322233059).
The spelling of 2001121022057 in words is "two trillion, one billion, one hundred twenty-one million, twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •