Base | Representation |
---|---|
bin | 101101100001011101001101… |
… | …100001110000111111111001 |
3 | 222020220000002211221122222120 |
4 | 231201131031201300333321 |
5 | 202220230020001400441 |
6 | 1545451431152111453 |
7 | 60112532131020606 |
oct | 5541351541607771 |
9 | 866800084848876 |
10 | 200211201200121 |
11 | 58880103644a31 |
12 | 1a556332235589 |
13 | 8793ab20c0007 |
14 | 37623b95cb6ad |
15 | 1822e45a97966 |
hex | b6174d870ff9 |
200211201200121 has 8 divisors (see below), whose sum is σ = 267053739738144. Its totient is φ = 133421398397760.
The previous prime is 200211201200051. The next prime is 200211201200149. The reversal of 200211201200121 is 121002102112002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200211201200121 - 27 = 200211201199993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200211201200121.
It is not an unprimeable number, because it can be changed into a prime (200211201205121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13183925056 + ... + 13183940241.
It is an arithmetic number, because the mean of its divisors is an integer number (33381717467268).
Almost surely, 2200211201200121 is an apocalyptic number.
It is an amenable number.
200211201200121 is a deficient number, since it is larger than the sum of its proper divisors (66842538538023).
200211201200121 is a wasteful number, since it uses less digits than its factorization.
200211201200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26367867831.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200211201200121 its reverse (121002102112002), we get a palindrome (321213303312123).
The spelling of 200211201200121 in words is "two hundred trillion, two hundred eleven billion, two hundred one million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •