Base | Representation |
---|---|
bin | 11001011111011010100101… |
… | …111111010111000000000000 |
3 | 112200221121120010201012020221 |
4 | 121133122211333113000000 |
5 | 104143302310412210422 |
6 | 1034234344401112424 |
7 | 32420452560054262 |
oct | 3137324577270000 |
9 | 480847503635227 |
10 | 112110021210112 |
11 | 327a36582a8602 |
12 | 106a780b328714 |
13 | 4a72c1154a893 |
14 | 1d98222735b32 |
15 | ce638b5c73c7 |
hex | 65f6a5fd7000 |
112110021210112 has 104 divisors (see below), whose sum is σ = 229480033153536. Its totient is φ = 54733845282816.
The previous prime is 112110021210073. The next prime is 112110021210133. The reversal of 112110021210112 is 211012120011211.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
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, 557696883 + ... + 557897869.
Almost surely, 2112110021210112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112110021210112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114740016576768).
112110021210112 is an abundant number, since it is smaller than the sum of its proper divisors (117370011943424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110021210112 is an equidigital number, since it uses as much as digits as its factorization.
112110021210112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204221 (or 204199 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112110021210112 its reverse (211012120011211), we get a palindrome (323122141221323).
The spelling of 112110021210112 in words is "one hundred twelve trillion, one hundred ten billion, twenty-one million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •