Base | Representation |
---|---|
bin | 11001010000101101111100… |
… | …000110011100110010101100 |
3 | 112120101001112002201000010211 |
4 | 121100231330012130302230 |
5 | 104030230300241024322 |
6 | 1032142345205112204 |
7 | 32254465411633021 |
oct | 3120557406346254 |
9 | 476331462630124 |
10 | 111100001111212 |
11 | 32444278290043 |
12 | 10563b116b8664 |
13 | 49cb8ba378449 |
14 | 1d613a9617548 |
15 | cc9e75332b77 |
hex | 650b7c19ccac |
111100001111212 has 12 divisors (see below), whose sum is σ = 195955907472640. Its totient is φ = 55112598976176.
The previous prime is 111100001111191. The next prime is 111100001111227. The reversal of 111100001111212 is 212111100001111.
It is a super-2 number, since 2×1111000011112122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111100001111192 and 111100001111201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 109350394287 + ... + 109350395302.
Almost surely, 2111100001111212 is an apocalyptic number.
It is an amenable number.
111100001111212 is a deficient number, since it is larger than the sum of its proper divisors (84855906361428).
111100001111212 is a wasteful number, since it uses less digits than its factorization.
111100001111212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218700789720 (or 218700789718 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111100001111212 its reverse (212111100001111), we get a palindrome (323211101112323).
It can be divided in two parts, 111100001111 and 212, that multiplied together give a palindrome (23553200235532).
The spelling of 111100001111212 in words is "one hundred eleven trillion, one hundred billion, one million, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •