Base | Representation |
---|---|
bin | 111000011100101100… |
… | …1010001110100110011 |
3 | 102120220011121021002222 |
4 | 1300321121101310303 |
5 | 3441230313342321 |
6 | 131404424231255 |
7 | 11520665050136 |
oct | 1607131216463 |
9 | 376804537088 |
10 | 121222012211 |
11 | 47456735a73 |
12 | 1b5b100b52b |
13 | b57b417b11 |
14 | 5c1d76621d |
15 | 32473dd3ab |
hex | 1c39651d33 |
121222012211 has 8 divisors (see below), whose sum is σ = 121935648000. Its totient is φ = 120509199360.
The previous prime is 121222012201. The next prime is 121222012253. The reversal of 121222012211 is 112210222121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121222012211 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 121222012211.
It is not an unprimeable number, because it can be changed into a prime (121222012201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 90995 + ... + 500723.
It is an arithmetic number, because the mean of its divisors is an integer number (15241956000).
Almost surely, 2121222012211 is an apocalyptic number.
121222012211 is a deficient number, since it is larger than the sum of its proper divisors (713635789).
121222012211 is a wasteful number, since it uses less digits than its factorization.
121222012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411469.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 121222012211 its reverse (112210222121), we get a palindrome (233432234332).
The spelling of 121222012211 in words is "one hundred twenty-one billion, two hundred twenty-two million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •