Base | Representation |
---|---|
bin | 101101100001010100110110… |
… | …001101101000000110001100 |
3 | 222020212010220221110000202021 |
4 | 231201110312031220012030 |
5 | 202220103121322011340 |
6 | 1545443344044135524 |
7 | 60112063435016206 |
oct | 5541246615500614 |
9 | 866763827400667 |
10 | 200202220110220 |
11 | 58877314a9a189 |
12 | 1a5546465375a4 |
13 | 8792cb0531033 |
14 | 3761ba68d9776 |
15 | 1822abc3a3e4a |
hex | b6153636818c |
200202220110220 has 24 divisors (see below), whose sum is σ = 420714410509008. Its totient is φ = 80025697896000.
The previous prime is 200202220110187. The next prime is 200202220110301. The reversal of 200202220110220 is 22011022202002.
It is a junction number, because it is equal to n+sod(n) for n = 200202220110194 and 200202220110203.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3449354511 + ... + 3449412550.
It is an arithmetic number, because the mean of its divisors is an integer number (17529767104542).
Almost surely, 2200202220110220 is an apocalyptic number.
200202220110220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200202220110220 is an abundant number, since it is smaller than the sum of its proper divisors (220512190398788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200202220110220 is a wasteful number, since it uses less digits than its factorization.
200202220110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6898768521 (or 6898768519 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 200202220110220 its reverse (22011022202002), we get a palindrome (222213242312222).
The spelling of 200202220110220 in words is "two hundred trillion, two hundred two billion, two hundred twenty million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •