Base | Representation |
---|---|
bin | 1010000110001110111011… |
… | …1000010001000011110101 |
3 | 1110022100201122001012111202 |
4 | 2201203232320101003311 |
5 | 2423344303011021323 |
6 | 35340140505142245 |
7 | 2224051642212350 |
oct | 241435670210365 |
9 | 43270648035452 |
10 | 11102203220213 |
11 | 35a0466313a66 |
12 | 12b382148a985 |
13 | 626c19521aa1 |
14 | 2a54c7071297 |
15 | 143bd9049d28 |
hex | a18eee110f5 |
11102203220213 has 4 divisors (see below), whose sum is σ = 12688232251680. Its totient is φ = 9516174188748.
The previous prime is 11102203220201. The next prime is 11102203220231. The reversal of 11102203220213 is 31202230220111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11102203220213 - 210 = 11102203219189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102203220233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 793014515723 + ... + 793014515736.
It is an arithmetic number, because the mean of its divisors is an integer number (3172058062920).
Almost surely, 211102203220213 is an apocalyptic number.
It is an amenable number.
11102203220213 is a deficient number, since it is larger than the sum of its proper divisors (1586029031467).
11102203220213 is an equidigital number, since it uses as much as digits as its factorization.
11102203220213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1586029031466.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11102203220213 its reverse (31202230220111), we get a palindrome (42304433440324).
The spelling of 11102203220213 in words is "eleven trillion, one hundred two billion, two hundred three million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •