Base | Representation |
---|---|
bin | 101101100110011001101100… |
… | …011000110010000011001011 |
3 | 222022002111020111112011101120 |
4 | 231212121230120302003023 |
5 | 202241311442431331321 |
6 | 1550311511201250323 |
7 | 60146222160463002 |
oct | 5546315430620313 |
9 | 868074214464346 |
10 | 200551021355211 |
11 | 589a123522310a |
12 | 1a5b016b3339a3 |
13 | 87b9b59952a67 |
14 | 3774a15083c39 |
15 | 182bbd4065ec6 |
hex | b6666c6320cb |
200551021355211 has 8 divisors (see below), whose sum is σ = 268418097024000. Its totient is φ = 133192313294952.
The previous prime is 200551021355183. The next prime is 200551021355297. The reversal of 200551021355211 is 112553120155002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200551021355211 - 214 = 200551021338827 is a prime.
It is a super-3 number, since 3×2005510213552113 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (200551021351211) 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, 127091901211 + ... + 127091902788.
It is an arithmetic number, because the mean of its divisors is an integer number (33552262128000).
Almost surely, 2200551021355211 is an apocalyptic number.
200551021355211 is a deficient number, since it is larger than the sum of its proper divisors (67867075668789).
200551021355211 is a wasteful number, since it uses less digits than its factorization.
200551021355211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254183804265.
The product of its (nonzero) digits is 15000, while the sum is 33.
The spelling of 200551021355211 in words is "two hundred trillion, five hundred fifty-one billion, twenty-one million, three hundred fifty-five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •