Base | Representation |
---|---|
bin | 1010000110110000100001… |
… | …0101011001000100110011 |
3 | 1110100020000001010021010122 |
4 | 2201230020111121010303 |
5 | 2424021234334021321 |
6 | 35344231334520455 |
7 | 2224521252356156 |
oct | 241541025310463 |
9 | 43306001107118 |
10 | 11111220220211 |
11 | 35a4273166581 |
12 | 12b551920612b |
13 | 627a25674b47 |
14 | 2a5b0082dc9d |
15 | 1440659838ab |
hex | a1b08559133 |
11111220220211 has 8 divisors (see below), whose sum is σ = 11337314466624. Its totient is φ = 10886543493120.
The previous prime is 11111220220171. The next prime is 11111220220213. The reversal of 11111220220211 is 11202202211111.
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-11111220220211 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 11111220220211.
It is not an unprimeable number, because it can be changed into a prime (11111220220213) 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, 354363995 + ... + 354395348.
It is an arithmetic number, because the mean of its divisors is an integer number (1417164308328).
Almost surely, 211111220220211 is an apocalyptic number.
11111220220211 is a deficient number, since it is larger than the sum of its proper divisors (226094246413).
11111220220211 is an equidigital number, since it uses as much as digits as its factorization.
11111220220211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 708759661.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11111220220211 its reverse (11202202211111), we get a palindrome (22313422431322).
The spelling of 11111220220211 in words is "eleven trillion, one hundred eleven billion, two hundred twenty million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •