Base | Representation |
---|---|
bin | 11001011110000000011100… |
… | …001111110111001101000000 |
3 | 112200121100200222001000112211 |
4 | 121132000130033313031000 |
5 | 104140211034034000000 |
6 | 1034122055140431504 |
7 | 32410455015622255 |
oct | 3136003417671500 |
9 | 480540628030484 |
10 | 112013221000000 |
11 | 327665a4091a61 |
12 | 10690ab50a8594 |
13 | 4a66a55935148 |
14 | 1d9367c64742c |
15 | ce3ac32487ba |
hex | 65e01c3f7340 |
112013221000000 has 1176 divisors, whose sum is σ = 307911686179968. Its totient is φ = 40395264000000.
The previous prime is 112013220999991. The next prime is 112013221000013. The reversal of 112013221000000 is 122310211.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 167 ways as a sum of consecutive naturals, for example, 1087506999949 + ... + 1087507000051.
Almost surely, 2112013221000000 is an apocalyptic number.
112013221000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112013221000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153955843089984).
112013221000000 is an abundant number, since it is smaller than the sum of its proper divisors (195898465179968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112013221000000 is an frugal number, since it uses more digits than its factorization.
112013221000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 303 (or 251 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 112013221000000 its reverse (122310211), we get a palindrome (112013343310211).
The spelling of 112013221000000 in words is "one hundred twelve trillion, thirteen billion, two hundred twenty-one million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •