Base | Representation |
---|---|
bin | 11001010010010110011011… |
… | …101011010010100110110011 |
3 | 112120202210010102201201121122 |
4 | 121102112123223102212303 |
5 | 104034100041200342321 |
6 | 1032310102425012455 |
7 | 32265546663564404 |
oct | 3122263353224663 |
9 | 476683112651548 |
10 | 111212200012211 |
11 | 3248791367a001 |
12 | 1058180492412b |
13 | 4a0935b2b06ac |
14 | 1d669b086d9ab |
15 | cccd404cb8ab |
hex | 65259bad29b3 |
111212200012211 has 4 divisors (see below), whose sum is σ = 111341667067800. Its totient is φ = 111082732956624.
The previous prime is 111212200012153. The next prime is 111212200012223. The reversal of 111212200012211 is 112210002212111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111212200012211 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 111212200012211.
It is not an unprimeable number, because it can be changed into a prime (111212200012811) 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, 64733526506 + ... + 64733528223.
It is an arithmetic number, because the mean of its divisors is an integer number (27835416766950).
Almost surely, 2111212200012211 is an apocalyptic number.
111212200012211 is a deficient number, since it is larger than the sum of its proper divisors (129467055589).
111212200012211 is an equidigital number, since it uses as much as digits as its factorization.
111212200012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129467055588.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 111212200012211 its reverse (112210002212111), we get a palindrome (223422202224322).
The spelling of 111212200012211 in words is "one hundred eleven trillion, two hundred twelve billion, two hundred million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •