Base | Representation |
---|---|
bin | 101101100000001001010100… |
… | …011000111001000001111101 |
3 | 222020120101121002001020010020 |
4 | 231200021110120321001331 |
5 | 202212241024213013041 |
6 | 1545342212502202353 |
7 | 60103162650325104 |
oct | 5540112430710175 |
9 | 866511532036106 |
10 | 200121122001021 |
11 | 5884598924a441 |
12 | 1a540992a233b9 |
13 | 8788457a5b080 |
14 | 375bcb1d9503b |
15 | 18209227c4866 |
hex | b6025463907d |
200121122001021 has 16 divisors (see below), whose sum is σ = 287417965490880. Its totient is φ = 123123791318400.
The previous prime is 200121122001013. The next prime is 200121122001139. The reversal of 200121122001021 is 120100221121002.
It is not a de Polignac number, because 200121122001021 - 23 = 200121122001013 is a prime.
It is a super-3 number, since 3×2001211220010213 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200121122006021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 576248656 + ... + 576595833.
It is an arithmetic number, because the mean of its divisors is an integer number (17963622843180).
Almost surely, 2200121122001021 is an apocalyptic number.
It is an amenable number.
200121122001021 is a deficient number, since it is larger than the sum of its proper divisors (87296843489859).
200121122001021 is a wasteful number, since it uses less digits than its factorization.
200121122001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152848956.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200121122001021 its reverse (120100221121002), we get a palindrome (320221343122023).
The spelling of 200121122001021 in words is "two hundred trillion, one hundred twenty-one billion, one hundred twenty-two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •