Base | Representation |
---|---|
bin | 11001100000111000101001… |
… | …100001000010000001101000 |
3 | 112201022021020100212222011112 |
4 | 121200320221201002001220 |
5 | 104201431123044201300 |
6 | 1034353005522245452 |
7 | 32430656325342206 |
oct | 3140705141020150 |
9 | 481267210788145 |
10 | 112211012100200 |
11 | 32832471aa5032 |
12 | 107032b4ab6888 |
13 | 4a7c5b7427b00 |
14 | 1d9d083212076 |
15 | ce8cec7e3e35 |
hex | 660e29842068 |
112211012100200 has 144 divisors (see below), whose sum is σ = 299120658238980. Its totient is φ = 38994595860480.
The previous prime is 112211012100197. The next prime is 112211012100221. The reversal of 112211012100200 is 2001210112211.
It can be written as a sum of positive squares in 18 ways, for example, as 38113657987876 + 74097354112324 = 6173626^2 + 8607982^2 .
It is a super-2 number, since 2×1122110121002002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 97068119 + ... + 98217318.
Almost surely, 2112211012100200 is an apocalyptic number.
112211012100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112211012100200 is an abundant number, since it is smaller than the sum of its proper divisors (186909646138780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112211012100200 is a wasteful number, since it uses less digits than its factorization.
112211012100200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195285496 (or 195285474 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112211012100200 its reverse (2001210112211), we get a palindrome (114212222212411).
The spelling of 112211012100200 in words is "one hundred twelve trillion, two hundred eleven billion, twelve million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •