Base | Representation |
---|---|
bin | 101101011110011001011101… |
… | …110011111110000100100011 |
3 | 222020010220121000211202021102 |
4 | 231132121131303332010203 |
5 | 202203304042334311321 |
6 | 1545211111201145015 |
7 | 60061411513622621 |
oct | 5536313563760443 |
9 | 866126530752242 |
10 | 200001021010211 |
11 | 587a9a58387443 |
12 | 1a52165532b16b |
13 | 877a027974235 |
14 | 375615b480511 |
15 | 181c743a20c0b |
hex | b5e65dcfe123 |
200001021010211 has 8 divisors (see below), whose sum is σ = 202339778191824. Its totient is φ = 197675821841760.
The previous prime is 200001021010199. The next prime is 200001021010237. The reversal of 200001021010211 is 112010120100002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200001021010211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200001021010192 and 200001021010201.
It is not an unprimeable number, because it can be changed into a prime (200001021012211) 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, 3389473616 + ... + 3389532621.
It is an arithmetic number, because the mean of its divisors is an integer number (25292472273978).
Almost surely, 2200001021010211 is an apocalyptic number.
200001021010211 is a deficient number, since it is larger than the sum of its proper divisors (2338757181613).
200001021010211 is a wasteful number, since it uses less digits than its factorization.
200001021010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6779006581.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200001021010211 its reverse (112010120100002), we get a palindrome (312011141110213).
The spelling of 200001021010211 in words is "two hundred trillion, one billion, twenty-one million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •