Base | Representation |
---|---|
bin | 101101100001011101001101… |
… | …011101010001011010111000 |
3 | 222020220000002202201211011212 |
4 | 231201131031131101122320 |
5 | 202220230014201202300 |
6 | 1545451431110542252 |
7 | 60112532115013463 |
oct | 5541351535213270 |
9 | 866800082654155 |
10 | 200211200022200 |
11 | 58880102a0aa44 |
12 | 1a556331967988 |
13 | 8793ab1a99b13 |
14 | 37623b93a22da |
15 | 1822e45913935 |
hex | b6174d7516b8 |
200211200022200 has 48 divisors (see below), whose sum is σ = 468888784933680. Its totient is φ = 79499921749760.
The previous prime is 200211200022199. The next prime is 200211200022233. The reversal of 200211200022200 is 2220002112002.
It is a super-2 number, since 2×2002112000222002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3653461652 + ... + 3653516451.
It is an arithmetic number, because the mean of its divisors is an integer number (9768516352785).
Almost surely, 2200211200022200 is an apocalyptic number.
200211200022200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200211200022200 is an abundant number, since it is smaller than the sum of its proper divisors (268677584911480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200211200022200 is a wasteful number, since it uses less digits than its factorization.
200211200022200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7306978256 (or 7306978247 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200211200022200 its reverse (2220002112002), we get a palindrome (202431202134202).
The spelling of 200211200022200 in words is "two hundred trillion, two hundred eleven billion, two hundred million, twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •