Base | Representation |
---|---|
bin | 101101100001010100101001… |
… | …110000000000101011101011 |
3 | 222020212010101101000010220110 |
4 | 231201110221300000223223 |
5 | 202220102204310120021 |
6 | 1545443311214425403 |
7 | 60112055315541600 |
oct | 5541245160005353 |
9 | 866763341003813 |
10 | 200202011020011 |
11 | 58877217a68660 |
12 | 1a5545a8502263 |
13 | 8792c79113310 |
14 | 3761b86c2c6a7 |
15 | 1822aa8d51476 |
hex | b61529c00aeb |
200202011020011 has 192 divisors, whose sum is σ = 378372908261376. Its totient is φ = 92481492096000.
The previous prime is 200202011020009. The next prime is 200202011020021. The reversal of 200202011020011 is 110020110202002.
It is not a de Polignac number, because 200202011020011 - 21 = 200202011020009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200202011020021) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 77281206 + ... + 79829748.
It is an arithmetic number, because the mean of its divisors is an integer number (1970692230528).
Almost surely, 2200202011020011 is an apocalyptic number.
200202011020011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
200202011020011 is a deficient number, since it is larger than the sum of its proper divisors (178170897241365).
200202011020011 is a wasteful number, since it uses less digits than its factorization.
200202011020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2548722 (or 2548715 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200202011020011 its reverse (110020110202002), we get a palindrome (310222121222013).
It can be divided in two parts, 2002020 and 11020011, that added together give a palindrome (13022031).
The spelling of 200202011020011 in words is "two hundred trillion, two hundred two billion, eleven million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •