Base | Representation |
---|---|
bin | 101101100000001001011010… |
… | …001111001011111010010001 |
3 | 222020120101211220200012100020 |
4 | 231200021122033023322101 |
5 | 202212241224322321314 |
6 | 1545342230325214053 |
7 | 60103165251324633 |
oct | 5540113217137221 |
9 | 866511756605306 |
10 | 200121220120209 |
11 | 58845a29676883 |
12 | 1a5409bb861329 |
13 | 878847219376b |
14 | 375bcc1016a53 |
15 | 182092b206da9 |
hex | b6025a3cbe91 |
200121220120209 has 8 divisors (see below), whose sum is σ = 266831026408800. Its totient is φ = 133412780289216.
The previous prime is 200121220120193. The next prime is 200121220120259. The reversal of 200121220120209 is 902021022121002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200121220120209 - 24 = 200121220120193 is a prime.
It is a super-2 number, since 2×2001212201202092 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200121220120259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 341272627 + ... + 341858520.
It is an arithmetic number, because the mean of its divisors is an integer number (33353878301100).
Almost surely, 2200121220120209 is an apocalyptic number.
It is an amenable number.
200121220120209 is a deficient number, since it is larger than the sum of its proper divisors (66709806288591).
200121220120209 is an equidigital number, since it uses as much as digits as its factorization.
200121220120209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683228799.
The product of its (nonzero) digits is 576, while the sum is 24.
The spelling of 200121220120209 in words is "two hundred trillion, one hundred twenty-one billion, two hundred twenty million, one hundred twenty thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •