Base | Representation |
---|---|
bin | 110011101111000010… |
… | …0110111101101011000 |
3 | 101121202202020211020000 |
4 | 1213132010313231120 |
5 | 3310013100013422 |
6 | 123012202333000 |
7 | 11012106266532 |
oct | 1473604675530 |
9 | 347682224200 |
10 | 111100001112 |
11 | 43132066241 |
12 | 196471ba160 |
13 | a62737b239 |
14 | 553d322852 |
15 | 2d5397dcac |
hex | 19de137b58 |
111100001112 has 80 divisors (see below), whose sum is σ = 315122042400. Its totient is φ = 36564540480.
The previous prime is 111100001029. The next prime is 111100001183. The reversal of 111100001112 is 211100001111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 111100001094 and 111100001103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1033939 + ... + 1136322.
It is an arithmetic number, because the mean of its divisors is an integer number (3939025530).
Almost surely, 2111100001112 is an apocalyptic number.
111100001112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111100001112 is an abundant number, since it is smaller than the sum of its proper divisors (204022041288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111100001112 is a wasteful number, since it uses less digits than its factorization.
111100001112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2170358 (or 2170345 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 111100001112 its reverse (211100001111), we get a palindrome (322200002223).
Subtracting 111100001112 from its reverse (211100001111), we obtain a palindrome (99999999999).
The spelling of 111100001112 in words is "one hundred eleven billion, one hundred million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •