Base | Representation |
---|---|
bin | 11001011101111111011001… |
… | …011100011001000101000100 |
3 | 112200121020210212002001002120 |
4 | 121131333121130121011010 |
5 | 104140201240123223022 |
6 | 1034121352022205540 |
7 | 32410415156233011 |
oct | 3135773134310504 |
9 | 480536725061076 |
10 | 112012100211012 |
11 | 32766079468671 |
12 | 106908418838b0 |
13 | 4a66907685bb1 |
14 | 1d935b3856708 |
15 | ce3a59b57d5c |
hex | 65dfd9719144 |
112012100211012 has 48 divisors (see below), whose sum is σ = 281426213920320. Its totient is φ = 34545440008192.
The previous prime is 112012100210981. The next prime is 112012100211047. The reversal of 112012100211012 is 210112001210211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 112012100210982 and 112012100211000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4653199173 + ... + 4653223244.
It is an arithmetic number, because the mean of its divisors is an integer number (5863046123340).
Almost surely, 2112012100211012 is an apocalyptic number.
112012100211012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112012100211012 is an abundant number, since it is smaller than the sum of its proper divisors (169414113709308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112012100211012 is a wasteful number, since it uses less digits than its factorization.
112012100211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9306422500 (or 9306422498 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112012100211012 its reverse (210112001210211), we get a palindrome (322124101421223).
The spelling of 112012100211012 in words is "one hundred twelve trillion, twelve billion, one hundred million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •