Base | Representation |
---|---|
bin | 1010001101001110000010… |
… | …0000100100010101111000 |
3 | 1110201211111220001211201122 |
4 | 2203103200200210111320 |
5 | 2432331102112223000 |
6 | 35511230043204412 |
7 | 2235531050255132 |
oct | 243234040442570 |
9 | 43654456054648 |
10 | 11222221211000 |
11 | 36373543468a8 |
12 | 1312b37216708 |
13 | 635335367b97 |
14 | 2ab23093c052 |
15 | 146db08a6085 |
hex | a34e0824578 |
11222221211000 has 32 divisors (see below), whose sum is σ = 26259997636080. Its totient is φ = 4488888484000.
The previous prime is 11222221210987. The next prime is 11222221211053. The reversal of 11222221211000 is 11212222211.
It is a self number, because there is not a number n which added to its sum of digits gives 11222221211000.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 5611109606 + ... + 5611111605.
Almost surely, 211222221211000 is an apocalyptic number.
11222221211000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11222221211000 is an abundant number, since it is smaller than the sum of its proper divisors (15037776425080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222221211000 is a wasteful number, since it uses less digits than its factorization.
11222221211000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11222221232 (or 11222221218 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11222221211000 its reverse (11212222211), we get a palindrome (11233433433211).
The spelling of 11222221211000 in words is "eleven trillion, two hundred twenty-two billion, two hundred twenty-one million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •