Base | Representation |
---|---|
bin | 11110101110001000101… |
… | …011010101000100011000 |
3 | 21110211011201111110000012 |
4 | 132232020223111010120 |
5 | 234042034213032300 |
6 | 4253500331101052 |
7 | 305344366636661 |
oct | 36561053250430 |
9 | 7424151443005 |
10 | 2111122002200 |
11 | 74435a373842 |
12 | 2a11965a1788 |
13 | 1241023467b3 |
14 | 74270a9c368 |
15 | 39dad855435 |
hex | 1eb88ad5118 |
2111122002200 has 96 divisors (see below), whose sum is σ = 4923977657760. Its totient is φ = 841766016000.
The previous prime is 2111122002173. The next prime is 2111122002221. The reversal of 2111122002200 is 22002211112.
It is a super-2 number, since 2×21111220022002 (a number of 25 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 23 ways as a sum of consecutive naturals, for example, 81362429 + ... + 81388371.
It is an arithmetic number, because the mean of its divisors is an integer number (51291433935).
Almost surely, 22111122002200 is an apocalyptic number.
2111122002200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2111122002200 is an abundant number, since it is smaller than the sum of its proper divisors (2812855655560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111122002200 is a wasteful number, since it uses less digits than its factorization.
2111122002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27237 (or 27228 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2111122002200 its reverse (22002211112), we get a palindrome (2133124213312).
The spelling of 2111122002200 in words is "two trillion, one hundred eleven billion, one hundred twenty-two million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •