Base | Representation |
---|---|
bin | 100000001011010101110… |
… | …011011011111110101100 |
3 | 21211101111100022201102012 |
4 | 200023111303123332230 |
5 | 242212014224033400 |
6 | 4411451130420352 |
7 | 315516413522633 |
oct | 40132563337654 |
9 | 7741440281365 |
10 | 2211200221100 |
11 | 782845973962 |
12 | 2b86665916b8 |
13 | 1306911119c0 |
14 | 7904628051a |
15 | 3c7b9890d35 |
hex | 202d5cdbfac |
2211200221100 has 72 divisors (see below), whose sum is σ = 5193372290400. Its totient is φ = 812340334080.
The previous prime is 2211200221093. The next prime is 2211200221163. The reversal of 2211200221100 is 11220021122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4014977 + ... + 4532376.
It is an arithmetic number, because the mean of its divisors is an integer number (72130170700).
Almost surely, 22211200221100 is an apocalyptic number.
2211200221100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2211200221100 is an abundant number, since it is smaller than the sum of its proper divisors (2982172069300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2211200221100 is a wasteful number, since it uses less digits than its factorization.
2211200221100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8547579 (or 8547572 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2211200221100 its reverse (11220021122), we get a palindrome (2222420242222).
It can be divided in two parts, 221120022 and 1100, that added together give a palindrome (221121122).
The spelling of 2211200221100 in words is "two trillion, two hundred eleven billion, two hundred million, two hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •