Base | Representation |
---|---|
bin | 11001010000111000010001… |
… | …101001011001001001101000 |
3 | 112120102010011121020112112111 |
4 | 121100320101221121021220 |
5 | 104030421013100323422 |
6 | 1032151422405052104 |
7 | 32255340432006535 |
oct | 3120702151311150 |
9 | 476363147215474 |
10 | 111111100011112 |
11 | 32448a53328893 |
12 | 105660aa6b7034 |
13 | 49cc96891c936 |
14 | 1d61b3d6add8c |
15 | cca3c490aa77 |
hex | 650e11a59268 |
111111100011112 has 16 divisors (see below), whose sum is σ = 208410501636000. Its totient is φ = 55534966241520.
The previous prime is 111111100011089. The next prime is 111111100011137. The reversal of 111111100011112 is 211110001111111.
It is a junction number, because it is equal to n+sod(n) for n = 111111100011092 and 111111100011101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2572947564 + ... + 2572990747.
It is an arithmetic number, because the mean of its divisors is an integer number (13025656352250).
Almost surely, 2111111100011112 is an apocalyptic number.
It is an amenable number.
111111100011112 is a deficient number, since it is larger than the sum of its proper divisors (97299401624888).
111111100011112 is a wasteful number, since it uses less digits than its factorization.
111111100011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5145941016 (or 5145941012 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 111111100011112 its reverse (211110001111111), we get a palindrome (322221101122223).
The spelling of 111111100011112 in words is "one hundred eleven trillion, one hundred eleven billion, one hundred million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •