Base | Representation |
---|---|
bin | 101101100001100101011111… |
… | …111111110110011001000011 |
3 | 222020220212002002111220101010 |
4 | 231201211133333312121003 |
5 | 202220401231324323021 |
6 | 1545455502234012003 |
7 | 60113265516121254 |
oct | 5541453777663103 |
9 | 866825062456333 |
10 | 200220101011011 |
11 | 58883960325644 |
12 | 1a557bb6877003 |
13 | 879489cb916c3 |
14 | 37629c15a2b2b |
15 | 18232b7083976 |
hex | b6195fff6643 |
200220101011011 has 8 divisors (see below), whose sum is σ = 266964047088640. Its totient is φ = 133478111137032.
The previous prime is 200220101010997. The next prime is 200220101011069. The reversal of 200220101011011 is 110110101022002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200220101011011 - 27 = 200220101010883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200220101011811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 488812075 + ... + 489221508.
It is an arithmetic number, because the mean of its divisors is an integer number (33370505886080).
Almost surely, 2200220101011011 is an apocalyptic number.
200220101011011 is a deficient number, since it is larger than the sum of its proper divisors (66743946077629).
200220101011011 is an equidigital number, since it uses as much as digits as its factorization.
200220101011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 978101825.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 200220101011011 its reverse (110110101022002), we get a palindrome (310330202033013).
The spelling of 200220101011011 in words is "two hundred trillion, two hundred twenty billion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •