Base | Representation |
---|---|
bin | 1010000000111111101110… |
… | …0001110011011010011001 |
3 | 1102222202110121212000022000 |
4 | 2200033323201303122121 |
5 | 2420411012101402301 |
6 | 35230540004351213 |
7 | 2214415051046235 |
oct | 240177341633231 |
9 | 42882417760260 |
10 | 11012221122201 |
11 | 356629080aa02 |
12 | 129a2aa6a5509 |
13 | 61b5a932a000 |
14 | 2a0dcc6b35c5 |
15 | 1416be557786 |
hex | a03fb873699 |
11012221122201 has 64 divisors (see below), whose sum is σ = 18603492768000. Its totient is φ = 6420079673280.
The previous prime is 11012221122193. The next prime is 11012221122247. The reversal of 11012221122201 is 10222112221011.
11012221122201 is a `hidden beast` number, since 110 + 1 + 222 + 112 + 220 + 1 = 666.
It is not a de Polignac number, because 11012221122201 - 23 = 11012221122193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11012221122251) 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 63 ways as a sum of consecutive naturals, for example, 3758310 + ... + 6012431.
It is an arithmetic number, because the mean of its divisors is an integer number (290679574500).
Almost surely, 211012221122201 is an apocalyptic number.
It is an amenable number.
11012221122201 is a deficient number, since it is larger than the sum of its proper divisors (7591271645799).
11012221122201 is an equidigital number, since it uses as much as digits as its factorization.
11012221122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9770808 (or 9770776 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11012221122201 its reverse (10222112221011), we get a palindrome (21234333343212).
The spelling of 11012221122201 in words is "eleven trillion, twelve billion, two hundred twenty-one million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •