Base | Representation |
---|---|
bin | 11011100101010100110010… |
… | …100110000011000001111000 |
3 | 120220112022222210210022002221 |
4 | 123211110302212003001320 |
5 | 111400034341212011300 |
6 | 1110002015543133424 |
7 | 34360342260116131 |
oct | 3345246246030170 |
9 | 526468883708087 |
10 | 121312200110200 |
11 | 357212403a5800 |
12 | 1173314a444274 |
13 | 528c8cac81118 |
14 | 21d5782a46c88 |
15 | e0591e67831a |
hex | 6e5532983078 |
121312200110200 has 72 divisors (see below), whose sum is σ = 310022851955040. Its totient is φ = 44113527304000.
The previous prime is 121312200110159. The next prime is 121312200110203. The reversal of 121312200110200 is 2011002213121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121312200110203) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 2506426216 + ... + 2506474615.
It is an arithmetic number, because the mean of its divisors is an integer number (4305872943820).
Almost surely, 2121312200110200 is an apocalyptic number.
121312200110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121312200110200 is an abundant number, since it is smaller than the sum of its proper divisors (188710651844840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121312200110200 is a wasteful number, since it uses less digits than its factorization.
121312200110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5012900869 (or 5012900849 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 121312200110200 its reverse (2011002213121), we get a palindrome (123323202323321).
The spelling of 121312200110200 in words is "one hundred twenty-one trillion, three hundred twelve billion, two hundred million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •