Base | Representation |
---|---|
bin | 1010001101001101111101… |
… | …0100010100001101110000 |
3 | 1110201211110111110021222022 |
4 | 2203103133110110031300 |
5 | 2432331032003101000 |
6 | 35511224050531012 |
7 | 2235530415333146 |
oct | 243233724241560 |
9 | 43654414407868 |
10 | 11222201222000 |
11 | 363734403386a |
12 | 1312b30596a68 |
13 | 635331189782 |
14 | 2ab22c017596 |
15 | 146dadc58585 |
hex | a34df514370 |
11222201222000 has 80 divisors (see below), whose sum is σ = 27181044757152. Its totient is φ = 4481310233600.
The previous prime is 11222201221967. The next prime is 11222201222017. The reversal of 11222201222000 is 22210222211.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 11222201222000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3545114 + ... + 5917113.
Almost surely, 211222201222000 is an apocalyptic number.
11222201222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11222201222000 is an abundant number, since it is smaller than the sum of its proper divisors (15958843535152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222201222000 is an equidigital number, since it uses as much as digits as its factorization.
11222201222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9462843 (or 9462827 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 11222201222000 its reverse (22210222211), we get a palindrome (11244411444211).
The spelling of 11222201222000 in words is "eleven trillion, two hundred twenty-two billion, two hundred one million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.461 sec. • engine limits •