Base | Representation |
---|---|
bin | 1010001101000101110101… |
… | …1100000010111000111111 |
3 | 1110201121211122021000121021 |
4 | 2203101131130002320333 |
5 | 2432312101141210421 |
6 | 35510223531045011 |
7 | 2235422416126621 |
oct | 243213534027077 |
9 | 43647748230537 |
10 | 11220022210111 |
11 | 36364260399a0 |
12 | 13126228a0767 |
13 | 6350748c6220 |
14 | 2ab0a2880c11 |
15 | 146cd27d5341 |
hex | a345d702e3f |
11220022210111 has 64 divisors (see below), whose sum is σ = 13453969858560. Its totient is φ = 9223002869760.
The previous prime is 11220022210073. The next prime is 11220022210147. The reversal of 11220022210111 is 11101222002211.
It is a cyclic number.
It is not a de Polignac number, because 11220022210111 - 211 = 11220022208063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11220022214111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1643474280 + ... + 1643481106.
It is an arithmetic number, because the mean of its divisors is an integer number (210218279040).
Almost surely, 211220022210111 is an apocalyptic number.
11220022210111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11220022210111 is a deficient number, since it is larger than the sum of its proper divisors (2233947648449).
11220022210111 is a wasteful number, since it uses less digits than its factorization.
11220022210111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8144.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11220022210111 its reverse (11101222002211), we get a palindrome (22321244212322).
The spelling of 11220022210111 in words is "eleven trillion, two hundred twenty billion, twenty-two million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •