Base | Representation |
---|---|
bin | 1011000001100110101101… |
… | …1111110110101101111011 |
3 | 1120220212112001020101020001 |
4 | 2300121223133312231323 |
5 | 3042102232003101021 |
6 | 41440510134213431 |
7 | 2360541306163546 |
oct | 260315337665573 |
9 | 46825461211201 |
10 | 12122201222011 |
11 | 3953aa6623671 |
12 | 14394447b4277 |
13 | 69c17094588a |
14 | 2dca093dd85d |
15 | 1604d6285091 |
hex | b066b7f6b7b |
12122201222011 has 8 divisors (see below), whose sum is σ = 12149961369840. Its totient is φ = 12094442860032.
The previous prime is 12122201221979. The next prime is 12122201222029. The reversal of 12122201222011 is 11022210222121.
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 12122201222011 - 25 = 12122201221979 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12122201222011.
It is not an unprimeable number, because it can be changed into a prime (12122201222041) 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, 13653955 + ... + 14514643.
It is an arithmetic number, because the mean of its divisors is an integer number (1518745171230).
Almost surely, 212122201222011 is an apocalyptic number.
12122201222011 is a deficient number, since it is larger than the sum of its proper divisors (27760147829).
12122201222011 is an equidigital number, since it uses as much as digits as its factorization.
12122201222011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 892925.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 12122201222011 its reverse (11022210222121), we get a palindrome (23144411444132).
The spelling of 12122201222011 in words is "twelve trillion, one hundred twenty-two billion, two hundred one million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •