Base | Representation |
---|---|
bin | 1010001101001001111100… |
… | …0000001011100110011000 |
3 | 1110201201200022002101210220 |
4 | 2203102133000023212120 |
5 | 2432321324240431013 |
6 | 35510525023440040 |
7 | 2235461603660235 |
oct | 243223700134630 |
9 | 43651608071726 |
10 | 11221122202008 |
11 | 363693aa49104 |
12 | 131288b156020 |
13 | 6351bb7732c4 |
14 | 2ab1689ba78c |
15 | 146d49168b23 |
hex | a349f00b998 |
11221122202008 has 32 divisors (see below), whose sum is σ = 28053339187200. Its totient is φ = 3740302909728.
The previous prime is 11221122201979. The next prime is 11221122202009. The reversal of 11221122202008 is 80020222112211.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11221122202009) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3151816 + ... + 5690007.
It is an arithmetic number, because the mean of its divisors is an integer number (876666849600).
Almost surely, 211221122202008 is an apocalyptic number.
It is an amenable number.
11221122202008 is an abundant number, since it is smaller than the sum of its proper divisors (16832216985192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11221122202008 is a wasteful number, since it uses less digits than its factorization.
11221122202008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8894711 (or 8894707 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 24.
Adding to 11221122202008 its reverse (80020222112211), we get a palindrome (91241344314219).
The spelling of 11221122202008 in words is "eleven trillion, two hundred twenty-one billion, one hundred twenty-two million, two hundred two thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •