Base | Representation |
---|---|
bin | 11001011101111111011001… |
… | …100011111111001010010000 |
3 | 112200121020210222211012012212 |
4 | 121131333121203333022100 |
5 | 104140201241130431000 |
6 | 1034121352133011252 |
7 | 32410415212164440 |
oct | 3135773143771220 |
9 | 480536728735185 |
10 | 112012102202000 |
11 | 3276607a5a8510 |
12 | 10690842483b28 |
13 | 4a66907c021b0 |
14 | 1d935b3c14120 |
15 | ce3a59decc35 |
hex | 65dfd98ff290 |
112012102202000 has 320 divisors, whose sum is σ = 363652387757568. Its totient is φ = 32227257600000.
The previous prime is 112012102201999. The next prime is 112012102202009. The reversal of 112012102202000 is 202201210211.
It is a super-2 number, since 2×1120121022020002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (112012102202009) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 25973051 + ... + 29977050.
Almost surely, 2112012102202000 is an apocalyptic number.
112012102202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112012102202000 is an abundant number, since it is smaller than the sum of its proper divisors (251640285555568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112012102202000 is a wasteful number, since it uses less digits than its factorization.
112012102202000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55950155 (or 55950139 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 112012102202000 its reverse (202201210211), we get a palindrome (112214303412211).
The spelling of 112012102202000 in words is "one hundred twelve trillion, twelve billion, one hundred two million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •