Base | Representation |
---|---|
bin | 110011001110111000… |
… | …0110110011010101000 |
3 | 101111222112221110012102 |
4 | 1212131300312122220 |
5 | 3300310334323422 |
6 | 122313140032532 |
7 | 10643265110225 |
oct | 1463560663250 |
9 | 344875843172 |
10 | 110021011112 |
11 | 42728aa1071 |
12 | 193a5992748 |
13 | a4b497560c |
14 | 5479cd294c |
15 | 2cddd98192 |
hex | 199dc366a8 |
110021011112 has 16 divisors (see below), whose sum is σ = 206292914100. Its totient is φ = 55009567360.
The previous prime is 110021011109. The next prime is 110021011141. The reversal of 110021011112 is 211110120011.
It can be written as a sum of positive squares in 2 ways, for example, as 91381662436 + 18639348676 = 302294^2 + 136526^2 .
It is a super-2 number, since 2×1100210111122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110021011093 and 110021011102.
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, 871964 + ... + 990132.
Almost surely, 2110021011112 is an apocalyptic number.
It is an amenable number.
110021011112 is a deficient number, since it is larger than the sum of its proper divisors (96271902988).
110021011112 is a wasteful number, since it uses less digits than its factorization.
110021011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234556 (or 234552 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110021011112 its reverse (211110120011), we get a palindrome (321131131123).
The spelling of 110021011112 in words is "one hundred ten billion, twenty-one million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •