Base | Representation |
---|---|
bin | 11001011111100101000000… |
… | …010011110111000100011000 |
3 | 112200222200102012222020110020 |
4 | 121133211000103313010120 |
5 | 104143443204223211300 |
6 | 1034243433541550440 |
7 | 32421326602022256 |
oct | 3137450023670430 |
9 | 480880365866406 |
10 | 112121200210200 |
11 | 327a8374585855 |
12 | 106a9a0b115420 |
13 | 4a73ca3588c2c |
14 | 1d989a32bd5d6 |
15 | ce67e2c238a0 |
hex | 65f9404f7118 |
112121200210200 has 48 divisors (see below), whose sum is σ = 347575720653480. Its totient is φ = 29898986722560.
The previous prime is 112121200210193. The next prime is 112121200210303. The reversal of 112121200210200 is 2012002121211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 112121200210200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 93434332909 + ... + 93434334108.
Almost surely, 2112121200210200 is an apocalyptic number.
112121200210200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112121200210200 is an abundant number, since it is smaller than the sum of its proper divisors (235454520443280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112121200210200 is a wasteful number, since it uses less digits than its factorization.
112121200210200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186868667036 (or 186868667027 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112121200210200 its reverse (2012002121211), we get a palindrome (114133202331411).
The spelling of 112121200210200 in words is "one hundred twelve trillion, one hundred twenty-one billion, two hundred million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •