Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …0101000010000010000011 |
3 | 1110101002020022212110000122 |
4 | 2201310200311002002003 |
5 | 2424143203100232321 |
6 | 35352320431010455 |
7 | 2225260305532514 |
oct | 241644065020203 |
9 | 43332208773018 |
10 | 11120221102211 |
11 | 35a80719aa431 |
12 | 12b720b669a2b |
13 | 62882b373720 |
14 | 2a6315dd4a0b |
15 | 1443e0c868ab |
hex | a1d20d42083 |
11120221102211 has 8 divisors (see below), whose sum is σ = 12007728957840. Its totient is φ = 10237299851232.
The previous prime is 11120221102189. The next prime is 11120221102261. The reversal of 11120221102211 is 11220112202111.
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-11120221102211 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 11120221102211.
It is not an unprimeable number, because it can be changed into a prime (11120221102261) 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, 1146646121 + ... + 1146655818.
It is an arithmetic number, because the mean of its divisors is an integer number (1500966119730).
Almost surely, 211120221102211 is an apocalyptic number.
11120221102211 is a deficient number, since it is larger than the sum of its proper divisors (887507855629).
11120221102211 is a wasteful number, since it uses less digits than its factorization.
11120221102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2293302325.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11120221102211 its reverse (11220112202111), we get a palindrome (22340333304322).
The spelling of 11120221102211 in words is "eleven trillion, one hundred twenty billion, two hundred twenty-one million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •