Base | Representation |
---|---|
bin | 11011100000110010000011… |
… | …001110001100101100001010 |
3 | 120212102111012110012201220010 |
4 | 123200302003032030230022 |
5 | 111324431020132401302 |
6 | 1105202350352212350 |
7 | 34325651204505003 |
oct | 3340620316145412 |
9 | 525374173181803 |
10 | 121000020200202 |
11 | 35610902a36890 |
12 | 116a2745b3a0b6 |
13 | 5269339948aa0 |
14 | 21c460a0541aa |
15 | dec74ca5c16c |
hex | 6e0c8338cb0a |
121000020200202 has 128 divisors (see below), whose sum is σ = 285233413893120. Its totient is φ = 33736138813440.
The previous prime is 121000020200197. The next prime is 121000020200209. The reversal of 121000020200202 is 202002020000121.
It is not an unprimeable number, because it can be changed into a prime (121000020200209) 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, 326063053 + ... + 326433935.
It is an arithmetic number, because the mean of its divisors is an integer number (2228386046040).
Almost surely, 2121000020200202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121000020200202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142616706946560).
121000020200202 is an abundant number, since it is smaller than the sum of its proper divisors (164233393692918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121000020200202 is a wasteful number, since it uses less digits than its factorization.
121000020200202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 372148.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 121000020200202 its reverse (202002020000121), we get a palindrome (323002040200323).
The spelling of 121000020200202 in words is "one hundred twenty-one trillion, twenty million, two hundred thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •