Base | Representation |
---|---|
bin | 101101011110100010000000… |
… | …111111101100100000000001 |
3 | 222020011210021211000210011220 |
4 | 231132202000333230200001 |
5 | 202203431343003033441 |
6 | 1545215230141025253 |
7 | 60062155145261124 |
oct | 5536420077544001 |
9 | 866153254023156 |
10 | 200010201221121 |
11 | 58802939374805 |
12 | 1a523397855229 |
13 | 877ab5b8703b5 |
14 | 375678c7a63bb |
15 | 181cace948466 |
hex | b5e880fec801 |
200010201221121 has 8 divisors (see below), whose sum is σ = 266680333695264. Its totient is φ = 133340101447200.
The previous prime is 200010201221113. The next prime is 200010201221197. The reversal of 200010201221121 is 121122102010002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200010201221121 - 23 = 200010201221113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200010201221121.
It is not an unprimeable number, because it can be changed into a prime (200010201121121) 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, 19031346 + ... + 27608196.
It is an arithmetic number, because the mean of its divisors is an integer number (33335041711908).
Almost surely, 2200010201221121 is an apocalyptic number.
It is an amenable number.
200010201221121 is a deficient number, since it is larger than the sum of its proper divisors (66670132474143).
200010201221121 is an equidigital number, since it uses as much as digits as its factorization.
200010201221121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16350111.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200010201221121 its reverse (121122102010002), we get a palindrome (321132303231123).
The spelling of 200010201221121 in words is "two hundred trillion, ten billion, two hundred one million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •