Base | Representation |
---|---|
bin | 11001000011100111110110… |
… | …011011000110010000010000 |
3 | 112110012000202011012211012120 |
4 | 121003213312123012100100 |
5 | 103421004311203241422 |
6 | 1030213122020054240 |
7 | 32132460314330634 |
oct | 3103476633062020 |
9 | 473160664184176 |
10 | 110200110212112 |
11 | 32127671338388 |
12 | 10439629b34380 |
13 | 4964a9739b3ab |
14 | 1d2d9dc910dc4 |
15 | cb18576a745c |
hex | 6439f66c6410 |
110200110212112 has 40 divisors (see below), whose sum is σ = 284758476163104. Its totient is φ = 36723710959104.
The previous prime is 110200110212021. The next prime is 110200110212177. The reversal of 110200110212112 is 211212011002011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110200110212091 and 110200110212100.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 301662793 + ... + 302027880.
Almost surely, 2110200110212112 is an apocalyptic number.
110200110212112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110200110212112 is an abundant number, since it is smaller than the sum of its proper divisors (174558365950992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200110212112 is a wasteful number, since it uses less digits than its factorization.
110200110212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603694487 (or 603694481 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110200110212112 its reverse (211212011002011), we get a palindrome (321412121214123).
The spelling of 110200110212112 in words is "one hundred ten trillion, two hundred billion, one hundred ten million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •