Base | Representation |
---|---|
bin | 1010000110001110111010… |
… | …1100110100100101101100 |
3 | 1110022100201102101210000012 |
4 | 2201203232230310211230 |
5 | 2423344301224020022 |
6 | 35340140320552352 |
7 | 2224051604545406 |
oct | 241435654644554 |
9 | 43270642353005 |
10 | 11102200220012 |
11 | 35a0464654960 |
12 | 12b38204826b8 |
13 | 626c18a11315 |
14 | 2a54c68cdb76 |
15 | 143bd8b55de2 |
hex | a18eeb3496c |
11102200220012 has 12 divisors (see below), whose sum is σ = 21195109511016. Its totient is φ = 5046454645440.
The previous prime is 11102200220003. The next prime is 11102200220029. The reversal of 11102200220012 is 21002200220111.
11102200220012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×111022002200123 (a number of 40 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 126161366093 + ... + 126161366180.
It is an arithmetic number, because the mean of its divisors is an integer number (1766259125918).
Almost surely, 211102200220012 is an apocalyptic number.
It is an amenable number.
11102200220012 is a deficient number, since it is larger than the sum of its proper divisors (10092909291004).
11102200220012 is a wasteful number, since it uses less digits than its factorization.
11102200220012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 252322732288 (or 252322732286 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11102200220012 its reverse (21002200220111), we get a palindrome (32104400440123).
Subtracting 11102200220012 from its reverse (21002200220111), we obtain a palindrome (9900000000099).
The spelling of 11102200220012 in words is "eleven trillion, one hundred two billion, two hundred million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •