Base | Representation |
---|---|
bin | 110000000001100010100000… |
… | …111100101110010111010000 |
3 | 1000200211200010021022022201022 |
4 | 300001202200330232113100 |
5 | 210140444200034134300 |
6 | 2025113243034255012 |
7 | 62326364361120131 |
oct | 6001424074562720 |
9 | 1020750107268638 |
10 | 211212012021200 |
11 | 61331569555803 |
12 | 1b832377587468 |
13 | 90b12904b5448 |
14 | 3a22a04707c88 |
15 | 1964198515285 |
hex | c018a0f2e5d0 |
211212012021200 has 60 divisors (see below), whose sum is σ = 513550556056608. Its totient is φ = 83466915580800.
The previous prime is 211212012021121. The next prime is 211212012021217. The reversal of 211212012021200 is 2120210212112.
It is a super-2 number, since 2×2112120120212002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3180870596 + ... + 3180936995.
Almost surely, 2211212012021200 is an apocalyptic number.
211212012021200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211212012021200 is an abundant number, since it is smaller than the sum of its proper divisors (302338544035408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211212012021200 is a wasteful number, since it uses less digits than its factorization.
211212012021200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6361807692 (or 6361807681 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 211212012021200 its reverse (2120210212112), we get a palindrome (213332222233312).
The spelling of 211212012021200 in words is "two hundred eleven trillion, two hundred twelve billion, twelve million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •