Base | Representation |
---|---|
bin | 10001101000000001001… |
… | …010001000100010011100 |
3 | 11021210022121212210012210 |
4 | 101220001022020202130 |
5 | 124321014223223400 |
6 | 2324230120000420 |
7 | 153335445632505 |
oct | 21500112104234 |
9 | 4253277783183 |
10 | 1211200211100 |
11 | 427737a41500 |
12 | 1768a4600110 |
13 | 8a2a5b41759 |
14 | 4289dc33bac |
15 | 2178d126950 |
hex | 11a0128889c |
1211200211100 has 108 divisors (see below), whose sum is σ = 3851950450712. Its totient is φ = 293624284800.
The previous prime is 1211200211069. The next prime is 1211200211129. The reversal of 1211200211100 is 11120021121.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 16646899 + ... + 16719498.
Almost surely, 21211200211100 is an apocalyptic number.
1211200211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1211200211100 is an abundant number, since it is smaller than the sum of its proper divisors (2640750239612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211200211100 is a wasteful number, since it uses less digits than its factorization.
1211200211100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33366436 (or 33366418 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1211200211100 its reverse (11120021121), we get a palindrome (1222320232221).
It can be divided in two parts, 121120021 and 1100, that added together give a palindrome (121121121).
The spelling of 1211200211100 in words is "one trillion, two hundred eleven billion, two hundred million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •