Base | Representation |
---|---|
bin | 1010001101000101110101… |
… | …1011001111101001010011 |
3 | 1110201121211121212100200012 |
4 | 2203101131123033221103 |
5 | 2432312101113001321 |
6 | 35510223522345135 |
7 | 2235422414263643 |
oct | 243213533175123 |
9 | 43647747770605 |
10 | 11220022000211 |
11 | 3636425a06222 |
12 | 13126227bb1ab |
13 | 63507485181b |
14 | 2ab0a2828523 |
15 | 146cd279305b |
hex | a345d6cfa53 |
11220022000211 has 8 divisors (see below), whose sum is σ = 11226736085184. Its totient is φ = 11213309628520.
The previous prime is 11220022000189. The next prime is 11220022000217. The reversal of 11220022000211 is 11200022002211.
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-11220022000211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11220022000217) 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, 12795140 + ... + 13643886.
It is an arithmetic number, because the mean of its divisors is an integer number (1403342010648).
Almost surely, 211220022000211 is an apocalyptic number.
11220022000211 is a deficient number, since it is larger than the sum of its proper divisors (6714084973).
11220022000211 is an equidigital number, since it uses as much as digits as its factorization.
11220022000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 856641.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11220022000211 its reverse (11200022002211), we get a palindrome (22420044002422).
It can be divided in two parts, 1122002 and 2000211, that added together give a palindrome (3122213).
The spelling of 11220022000211 in words is "eleven trillion, two hundred twenty billion, twenty-two million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.288 sec. • engine limits •