Base | Representation |
---|---|
bin | 11011100000111011100010… |
… | …101010010001100010011000 |
3 | 120212110110111200121210002022 |
4 | 123200323202222101202120 |
5 | 111330112403100031300 |
6 | 1105211153523354012 |
7 | 34326461562622163 |
oct | 3340734252214230 |
9 | 525413450553068 |
10 | 121010211330200 |
11 | 35615162625675 |
12 | 116a470ab22908 |
13 | 526a2a210611a |
14 | 21c4cd572aada |
15 | decb475c1285 |
hex | 6e0ee2a91898 |
121010211330200 has 48 divisors (see below), whose sum is σ = 290424507207360. Its totient is φ = 46842662448000.
The previous prime is 121010211330187. The next prime is 121010211330209. The reversal of 121010211330200 is 2033112010121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121010211330209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9758881811 + ... + 9758894210.
It is an arithmetic number, because the mean of its divisors is an integer number (6050510566820).
Almost surely, 2121010211330200 is an apocalyptic number.
121010211330200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121010211330200 is an abundant number, since it is smaller than the sum of its proper divisors (169414295877160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121010211330200 is a wasteful number, since it uses less digits than its factorization.
121010211330200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19517776068 (or 19517776059 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 121010211330200 its reverse (2033112010121), we get a palindrome (123043323340321).
The spelling of 121010211330200 in words is "one hundred twenty-one trillion, ten billion, two hundred eleven million, three hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •