Base | Representation |
---|---|
bin | 110011101100011010… |
… | …1001101110001101000 |
3 | 101121112121200110122010 |
4 | 1213120311031301220 |
5 | 3304323033323422 |
6 | 122555340355520 |
7 | 11006660345112 |
oct | 1473065156150 |
9 | 347477613563 |
10 | 111012011112 |
11 | 43097428032 |
12 | 19621845ba0 |
13 | a612081152 |
14 | 553177a3b2 |
15 | 2d4ad9cb0c |
hex | 19d8d4dc68 |
111012011112 has 32 divisors (see below), whose sum is σ = 278477246880. Its totient is φ = 36877707840.
The previous prime is 111012011069. The next prime is 111012011137. The reversal of 111012011112 is 211110210111.
It is a super-2 number, since 2×1110120111122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
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 7 ways as a sum of consecutive naturals, for example, 7886314 + ... + 7900377.
It is an arithmetic number, because the mean of its divisors is an integer number (8702413965).
Almost surely, 2111012011112 is an apocalyptic number.
111012011112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111012011112 is an abundant number, since it is smaller than the sum of its proper divisors (167465235768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111012011112 is a wasteful number, since it uses less digits than its factorization.
111012011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15786993 (or 15786989 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 111012011112 its reverse (211110210111), we get a palindrome (322122221223).
The spelling of 111012011112 in words is "one hundred eleven billion, twelve million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •