Base | Representation |
---|---|
bin | 1010001100000011011100… |
… | …1101111111010110011000 |
3 | 1110122220211122201221211021 |
4 | 2203000313031333112120 |
5 | 2432014101441402300 |
6 | 35454115315212224 |
7 | 2234221662312244 |
oct | 243006715772630 |
9 | 43586748657737 |
10 | 11202201122200 |
11 | 3629910546870 |
12 | 130b08a5a7074 |
13 | 6334947785aa |
14 | 2aa291b07424 |
15 | 1465dcebcd1a |
hex | a303737f598 |
11202201122200 has 48 divisors (see below), whose sum is σ = 28412855579160. Its totient is φ = 4073527680000.
The previous prime is 11202201122143. The next prime is 11202201122201. The reversal of 11202201122200 is 222110220211.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202201122201) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2545952601 + ... + 2545957000.
Almost surely, 211202201122200 is an apocalyptic number.
11202201122200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11202201122200 is an abundant number, since it is smaller than the sum of its proper divisors (17210654456960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11202201122200 is a wasteful number, since it uses less digits than its factorization.
11202201122200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5091909628 (or 5091909619 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11202201122200 its reverse (222110220211), we get a palindrome (11424311342411).
The spelling of 11202201122200 in words is "eleven trillion, two hundred two billion, two hundred one million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •