Base | Representation |
---|---|
bin | 11011100010100011101010… |
… | …011100111011101011010011 |
3 | 120212212011002012210121221122 |
4 | 123202203222130323223103 |
5 | 111333430334331401321 |
6 | 1105334403410512455 |
7 | 34340530231056110 |
oct | 3342435234735323 |
9 | 525764065717848 |
10 | 121122011200211 |
11 | 3565861375075a |
12 | 1170231059572b |
13 | 52779ab478b68 |
14 | 21ca49d991907 |
15 | e009dc6e88ab |
hex | 6e28ea73bad3 |
121122011200211 has 8 divisors (see below), whose sum is σ = 138441366658560. Its totient is φ = 103806708492168.
The previous prime is 121122011200171. The next prime is 121122011200219. The reversal of 121122011200211 is 112002110221121.
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 121122011200211 - 210 = 121122011199187 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121122011200211.
It is not an unprimeable number, because it can be changed into a prime (121122011200219) 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, 1013123531 + ... + 1013243076.
It is an arithmetic number, because the mean of its divisors is an integer number (17305170832320).
Almost surely, 2121122011200211 is an apocalyptic number.
121122011200211 is a deficient number, since it is larger than the sum of its proper divisors (17319355458349).
121122011200211 is an equidigital number, since it uses as much as digits as its factorization.
121122011200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2026375153.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 121122011200211 its reverse (112002110221121), we get a palindrome (233124121421332).
The spelling of 121122011200211 in words is "one hundred twenty-one trillion, one hundred twenty-two billion, eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •