Base | Representation |
---|---|
bin | 1101000111101… |
… | …00001100010000 |
3 | 21200002020010011 |
4 | 12203310030100 |
5 | 211133131422 |
6 | 14530444304 |
7 | 2504266432 |
oct | 643641420 |
9 | 250066104 |
10 | 110052112 |
11 | 57137865 |
12 | 30a33694 |
13 | 19a52cc1 |
14 | 1088a652 |
15 | 99dd077 |
hex | 68f4310 |
110052112 has 20 divisors (see below), whose sum is σ = 213575616. Its totient is φ = 54935840.
The previous prime is 110052053. The next prime is 110052119. The reversal of 110052112 is 211250011.
It is a super-2 number, since 2×1100521122 = 24222934711321088, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110052092 and 110052101.
It is not an unprimeable number, because it can be changed into a prime (110052119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5037 + ... + 15667.
Almost surely, 2110052112 is an apocalyptic number.
It is an amenable number.
110052112 is a deficient number, since it is larger than the sum of its proper divisors (103523504).
110052112 is a wasteful number, since it uses less digits than its factorization.
110052112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11286 (or 11280 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 110052112 is about 10490.5725296573. The cubic root of 110052112 is about 479.2176375402.
The spelling of 110052112 in words is "one hundred ten million, fifty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •