Base | Representation |
---|---|
bin | 11101010000000100100… |
… | …110111001111100101101 |
3 | 21010011110212011211200020 |
4 | 131100010212321330231 |
5 | 230413212213032341 |
6 | 4135234242352353 |
7 | 265140461050434 |
oct | 35200446717455 |
9 | 7104425154606 |
10 | 2010122002221 |
11 | 705540514983 |
12 | 2856a995b6b9 |
13 | 1177275c9bb8 |
14 | 6d40ccd011b |
15 | 3744b939566 |
hex | 1d4049b9f2d |
2010122002221 has 4 divisors (see below), whose sum is σ = 2680162669632. Its totient is φ = 1340081334812.
The previous prime is 2010122002181. The next prime is 2010122002237. The reversal of 2010122002221 is 1222002210102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2010122002221 - 29 = 2010122001709 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2010122002221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010122002241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 335020333701 + ... + 335020333706.
It is an arithmetic number, because the mean of its divisors is an integer number (670040667408).
Almost surely, 22010122002221 is an apocalyptic number.
It is an amenable number.
2010122002221 is a deficient number, since it is larger than the sum of its proper divisors (670040667411).
2010122002221 is an equidigital number, since it uses as much as digits as its factorization.
2010122002221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670040667410.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2010122002221 its reverse (1222002210102), we get a palindrome (3232124212323).
The spelling of 2010122002221 in words is "two trillion, ten billion, one hundred twenty-two million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •