Base | Representation |
---|---|
bin | 11101001111111110000… |
… | …100000111111011000001 |
3 | 21010011012012121101022120 |
4 | 131033332010013323001 |
5 | 230413001112033441 |
6 | 4135215321354453 |
7 | 265134655660062 |
oct | 35177604077301 |
9 | 7104165541276 |
10 | 2010012221121 |
11 | 7054945527a3 |
12 | 285679038a29 |
13 | 11770a940378 |
14 | 6d3dc4b4569 |
15 | 37441ea1966 |
hex | 1d3fe107ec1 |
2010012221121 has 8 divisors (see below), whose sum is σ = 2684535717600. Its totient is φ = 1337748436032.
The previous prime is 2010012221089. The next prime is 2010012221149. The reversal of 2010012221121 is 1211222100102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2010012221121 - 25 = 2010012221089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2010012221121.
It is not an unprimeable number, because it can be changed into a prime (2010012221171) 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 7 ways as a sum of consecutive naturals, for example, 564925771 + ... + 564929328.
It is an arithmetic number, because the mean of its divisors is an integer number (335566964700).
Almost surely, 22010012221121 is an apocalyptic number.
It is an amenable number.
2010012221121 is a deficient number, since it is larger than the sum of its proper divisors (674523496479).
2010012221121 is a wasteful number, since it uses less digits than its factorization.
2010012221121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1129855695.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2010012221121 its reverse (1211222100102), we get a palindrome (3221234321223).
The spelling of 2010012221121 in words is "two trillion, ten billion, twelve million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •