Base | Representation |
---|---|
bin | 11110111000011100111… |
… | …111011000010110101101 |
3 | 21111212202210010021101221 |
4 | 132320130333120112231 |
5 | 234232231224033401 |
6 | 4302531511503341 |
7 | 306216046150162 |
oct | 36703477302655 |
9 | 7455683107357 |
10 | 2122200221101 |
11 | 749024776654 |
12 | 2a3368687b51 |
13 | 1251795298cc |
14 | 74a020d0069 |
15 | 3a30b1e57a1 |
hex | 1ee1cfd85ad |
2122200221101 has 8 divisors (see below), whose sum is σ = 2310925831200. Its totient is φ = 1941177697200.
The previous prime is 2122200221069. The next prime is 2122200221117. The reversal of 2122200221101 is 1011220022212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2122200221101 - 25 = 2122200221069 is a prime.
It is a super-2 number, since 2×21222002211012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2122200227101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1925770975 + ... + 1925772076.
It is an arithmetic number, because the mean of its divisors is an integer number (288865728900).
Almost surely, 22122200221101 is an apocalyptic number.
It is an amenable number.
2122200221101 is a deficient number, since it is larger than the sum of its proper divisors (188725610099).
2122200221101 is a wasteful number, since it uses less digits than its factorization.
2122200221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3851543099.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2122200221101 its reverse (1011220022212), we get a palindrome (3133420243313).
The spelling of 2122200221101 in words is "two trillion, one hundred twenty-two billion, two hundred million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •