Base | Representation |
---|---|
bin | 101101100001011101111110… |
… | …011001110100010101001000 |
3 | 222020220002012222220222121212 |
4 | 231201131332121310111020 |
5 | 202220233204411401300 |
6 | 1545452044403352252 |
7 | 60112561345633442 |
oct | 5541357631642510 |
9 | 866802188828555 |
10 | 200212021200200 |
11 | 588804944a6149 |
12 | 1a556520982688 |
13 | 8793bb2c56369 |
14 | 3762456481492 |
15 | 1822e92a70935 |
hex | b6177e674548 |
200212021200200 has 96 divisors (see below), whose sum is σ = 475313873177160. Its totient is φ = 78411202560000.
The previous prime is 200212021200187. The next prime is 200212021200227. The reversal of 200212021200200 is 2002120212002.
It can be written as a sum of positive squares in 12 ways, for example, as 22914966893764 + 177297054306436 = 4786958^2 + 13315294^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48047801 + ... + 52048200.
Almost surely, 2200212021200200 is an apocalyptic number.
200212021200200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200212021200200 is an abundant number, since it is smaller than the sum of its proper divisors (275101851976960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200212021200200 is a wasteful number, since it uses less digits than its factorization.
200212021200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100096227 (or 100096218 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200212021200200 its reverse (2002120212002), we get a palindrome (202214141412202).
200212021200200 divided by its reverse (2002120212002) gives a square (100 = 102).
The spelling of 200212021200200 in words is "two hundred trillion, two hundred twelve billion, twenty-one million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •