Base | Representation |
---|---|
bin | 11001011111011100100111… |
… | …111010100110010001000000 |
3 | 112200221211012001100222211202 |
4 | 121133130213322212101000 |
5 | 104143321241424000000 |
6 | 1034235344545400332 |
7 | 32420560566010655 |
oct | 3137344772462100 |
9 | 480854161328752 |
10 | 112112201000000 |
11 | 327a4576783a53 |
12 | 106a81193390a8 |
13 | 4a7319b024296 |
14 | 1d9838c031c2c |
15 | ce6467b50dd5 |
hex | 65f727ea6440 |
112112201000000 has 98 divisors (see below), whose sum is σ = 278087253992274. Its totient is φ = 44844880000000.
The previous prime is 112112200999991. The next prime is 112112201000017. The reversal of 112112201000000 is 102211211.
It can be written as a sum of positive squares in 7 ways, for example, as 109974148764736 + 2138052235264 = 10486856^2 + 1462208^2 .
It is a super-2 number, since 2×1121122010000002 (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 13 ways as a sum of consecutive naturals, for example, 55056101 + ... + 57056100.
Almost surely, 2112112201000000 is an apocalyptic number.
112112201000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112112201000000 is an abundant number, since it is smaller than the sum of its proper divisors (165975052992274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112112201000000 is an frugal number, since it uses more digits than its factorization.
112112201000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112112243 (or 112112208 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112112201000000 its reverse (102211211), we get a palindrome (112112303211211).
The spelling of 112112201000000 in words is "one hundred twelve trillion, one hundred twelve billion, two hundred one million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •