Base | Representation |
---|---|
bin | 11101001111111101011… |
… | …010001010001000101101 |
3 | 21010011011102220110210212 |
4 | 131033331122022020231 |
5 | 230412440303021031 |
6 | 4135214245512205 |
7 | 265134463321205 |
oct | 35177532121055 |
9 | 7104142813725 |
10 | 2010001220141 |
11 | 705489319582 |
12 | 285675412665 |
13 | 11770858b005 |
14 | 6d3dac4d405 |
15 | 3744102c12b |
hex | 1d3fd68a22d |
2010001220141 has 2 divisors, whose sum is σ = 2010001220142. Its totient is φ = 2010001220140.
The previous prime is 2010001220107. The next prime is 2010001220167. The reversal of 2010001220141 is 1410221000102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1887749594116 + 122251626025 = 1373954^2 + 349645^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010001220141 - 222 = 2009997025837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010001220341) 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 as a sum of consecutive naturals, namely, 1005000610070 + 1005000610071.
It is an arithmetic number, because the mean of its divisors is an integer number (1005000610071).
Almost surely, 22010001220141 is an apocalyptic number.
It is an amenable number.
2010001220141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010001220141 is an equidigital number, since it uses as much as digits as its factorization.
2010001220141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2010001220141 its reverse (1410221000102), we get a palindrome (3420222220243).
The spelling of 2010001220141 in words is "two trillion, ten billion, one million, two hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •