Base | Representation |
---|---|
bin | 111000110100001101… |
… | …1011010110000000011 |
3 | 102122221011102012002112 |
4 | 1301220123122300003 |
5 | 3444334320232321 |
6 | 132015013205535 |
7 | 11546356154105 |
oct | 1615033326003 |
9 | 378834365075 |
10 | 122011102211 |
11 | 478210a4a69 |
12 | 1b7913308ab |
13 | b675a4ab8b |
14 | 5c96491575 |
15 | 329180ca5b |
hex | 1c686dac03 |
122011102211 has 4 divisors (see below), whose sum is σ = 122011905624. Its totient is φ = 122010298800.
The previous prime is 122011102201. The next prime is 122011102231. The reversal of 122011102211 is 112201110221.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 112201110221 = 157 ⋅714656753.
It is a cyclic number.
It is not a de Polignac number, because 122011102211 - 210 = 122011101187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122011102201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 96725 + ... + 503366.
It is an arithmetic number, because the mean of its divisors is an integer number (30502976406).
Almost surely, 2122011102211 is an apocalyptic number.
122011102211 is a deficient number, since it is larger than the sum of its proper divisors (803413).
122011102211 is an equidigital number, since it uses as much as digits as its factorization.
122011102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803412.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 122011102211 its reverse (112201110221), we get a palindrome (234212212432).
The spelling of 122011102211 in words is "one hundred twenty-two billion, eleven million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •