Base | Representation |
---|---|
bin | 110000000001100000110101… |
… | …100110011000001100001100 |
3 | 1000200211111110202101000121011 |
4 | 300001200311212120030030 |
5 | 210140432003004013400 |
6 | 2025112344220215004 |
7 | 62326301631523513 |
oct | 6001406546301414 |
9 | 1020744422330534 |
10 | 211210211001100 |
11 | 61330824964743 |
12 | 1b831b5439a464 |
13 | 90b1064328c8c |
14 | 3a228b344767a |
15 | 19640e03598ba |
hex | c0183599830c |
211210211001100 has 36 divisors (see below), whose sum is σ = 460858346629408. Its totient is φ = 84017321496000.
The previous prime is 211210211001059. The next prime is 211210211001121. The reversal of 211210211001100 is 1100112012112.
It is a happy number.
It is a super-2 number, since 2×2112102110011002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5834518116 + ... + 5834554315.
Almost surely, 2211210211001100 is an apocalyptic number.
211210211001100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211210211001100 is an abundant number, since it is smaller than the sum of its proper divisors (249648135628308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211210211001100 is a wasteful number, since it uses less digits than its factorization.
211210211001100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11669072626 (or 11669072619 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211210211001100 its reverse (1100112012112), we get a palindrome (212310323013212).
The spelling of 211210211001100 in words is "two hundred eleven trillion, two hundred ten billion, two hundred eleven million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •