Base | Representation |
---|---|
bin | 1010001011111111110001… |
… | …0001100011100010011000 |
3 | 1110122211021201220120010022 |
4 | 2202333330101203202120 |
5 | 2432010040310413422 |
6 | 35453433231210012 |
7 | 2234155323523343 |
oct | 242777421434230 |
9 | 43584251816108 |
10 | 11201212201112 |
11 | 36294532aa80a |
12 | 130aa53376908 |
13 | 63336791a09b |
14 | 2aa1da64145a |
15 | 146581279342 |
hex | a2ffc463898 |
11201212201112 has 32 divisors (see below), whose sum is σ = 21034202472000. Its totient is φ = 5592092467104.
The previous prime is 11201212201097. The next prime is 11201212201141. The reversal of 11201212201112 is 21110221210211.
11201212201112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120527639 + ... + 120620537.
It is an arithmetic number, because the mean of its divisors is an integer number (657318827250).
Almost surely, 211201212201112 is an apocalyptic number.
It is an amenable number.
11201212201112 is a deficient number, since it is larger than the sum of its proper divisors (9832990270888).
11201212201112 is a wasteful number, since it uses less digits than its factorization.
11201212201112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115655 (or 115651 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11201212201112 its reverse (21110221210211), we get a palindrome (32311433411323).
Subtracting 11201212201112 from its reverse (21110221210211), we obtain a palindrome (9909009009099).
It can be divided in two parts, 1120121 and 2201112, that added together give a palindrome (3321233).
The spelling of 11201212201112 in words is "eleven trillion, two hundred one billion, two hundred twelve million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •