Base | Representation |
---|---|
bin | 110011010100110011… |
… | …1111110011001101000 |
3 | 101112111102101200212210 |
4 | 1212221213332121220 |
5 | 3301212310323422 |
6 | 122345005205120 |
7 | 10651232431161 |
oct | 1465147763150 |
9 | 345442350783 |
10 | 110220011112 |
11 | 42820360782 |
12 | 194405607a0 |
13 | a516c6c6b3 |
14 | 54984d4768 |
15 | 2d015a610c |
hex | 19a99fe668 |
110220011112 has 32 divisors (see below), whose sum is σ = 275558356800. Its totient is φ = 36738893184.
The previous prime is 110220011089. The next prime is 110220011117. The reversal of 110220011112 is 211110022011.
It is a super-3 number, since 3×1102200111123 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (110220011117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1263613 + ... + 1348019.
It is an arithmetic number, because the mean of its divisors is an integer number (8611198650).
Almost surely, 2110220011112 is an apocalyptic number.
110220011112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110220011112 is an abundant number, since it is smaller than the sum of its proper divisors (165338345688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110220011112 is a wasteful number, since it uses less digits than its factorization.
110220011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138825 (or 138821 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110220011112 its reverse (211110022011), we get a palindrome (321330033123).
The spelling of 110220011112 in words is "one hundred ten billion, two hundred twenty million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •