Base | Representation |
---|---|
bin | 11101010000100010010… |
… | …010110011101011001001 |
3 | 21010012202120100021221202 |
4 | 131100202102303223021 |
5 | 230420222213100441 |
6 | 4135355513313545 |
7 | 265156016304224 |
oct | 35204222635311 |
9 | 7105676307852 |
10 | 2010620050121 |
11 | 705776668711 |
12 | 2858087058b5 |
13 | 1177a684a5b7 |
14 | 6d4590d85bb |
15 | 3747a51919b |
hex | 1d4224b3ac9 |
2010620050121 has 2 divisors, whose sum is σ = 2010620050122. Its totient is φ = 2010620050120.
The previous prime is 2010620050091. The next prime is 2010620050129. The reversal of 2010620050121 is 1210500260102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1960000000000 + 50620050121 = 1400000^2 + 224989^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010620050121 - 222 = 2010615855817 is a prime.
It is a super-2 number, since 2×20106200501212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2010620050093 and 2010620050102.
It is not a weakly prime, because it can be changed into another prime (2010620050129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005310025060 + 1005310025061.
It is an arithmetic number, because the mean of its divisors is an integer number (1005310025061).
Almost surely, 22010620050121 is an apocalyptic number.
It is an amenable number.
2010620050121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010620050121 is an equidigital number, since it uses as much as digits as its factorization.
2010620050121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
The spelling of 2010620050121 in words is "two trillion, ten billion, six hundred twenty million, fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •