Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1111000011000110000 |
3 | 101112110002211112022211 |
4 | 1212220133320120300 |
5 | 3301142441041422 |
6 | 122343052141504 |
7 | 10650612666100 |
oct | 1465037703060 |
9 | 345402745284 |
10 | 110201112112 |
11 | 42810722673 |
12 | 19436167894 |
13 | a513083460 |
14 | 5495bb5200 |
15 | 2ceeac1577 |
hex | 19a87f8630 |
110201112112 has 60 divisors (see below), whose sum is σ = 267479921856. Its totient is φ = 43596040320.
The previous prime is 110201112079. The next prime is 110201112157. The reversal of 110201112112 is 211211102011.
It is a happy number.
It is a super-2 number, since 2×1102011121122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 110201112092 and 110201112101.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5396064 + ... + 5416447.
Almost surely, 2110201112112 is an apocalyptic number.
It is an amenable number.
110201112112 is an abundant number, since it is smaller than the sum of its proper divisors (157278809744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201112112 is a wasteful number, since it uses less digits than its factorization.
110201112112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10812546 (or 10812533 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110201112112 its reverse (211211102011), we get a palindrome (321412214123).
The spelling of 110201112112 in words is "one hundred ten billion, two hundred one million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •