Base | Representation |
---|---|
bin | 110011001110100111… |
… | …0100001001001101000 |
3 | 101111221221000012112002 |
4 | 1212131032201021220 |
5 | 3300301033323422 |
6 | 122312215110132 |
7 | 10643125444163 |
oct | 1463516411150 |
9 | 344857005462 |
10 | 110012011112 |
11 | 42723a04253 |
12 | 193a2972348 |
13 | a4b2b43c83 |
14 | 5478a2cada |
15 | 2cdd1bb692 |
hex | 199d3a1268 |
110012011112 has 128 divisors (see below), whose sum is σ = 228671078400. Its totient is φ = 49415443200.
The previous prime is 110012011069. The next prime is 110012011117. The reversal of 110012011112 is 211110210011.
It is a super-2 number, since 2×1100120111122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110012011093 and 110012011102.
It is not an unprimeable number, because it can be changed into a prime (110012011117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 99738353 + ... + 99739455.
It is an arithmetic number, because the mean of its divisors is an integer number (1786492800).
Almost surely, 2110012011112 is an apocalyptic number.
It is an amenable number.
110012011112 is an abundant number, since it is smaller than the sum of its proper divisors (118659067288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110012011112 is a wasteful number, since it uses less digits than its factorization.
110012011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1567 (or 1563 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110012011112 its reverse (211110210011), we get a palindrome (321122221123).
The spelling of 110012011112 in words is "one hundred ten billion, twelve million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •