Base | Representation |
---|---|
bin | 1010001101001101101010… |
… | …0110001100000101010001 |
3 | 1110201211020222102110220101 |
4 | 2203103122212030011101 |
5 | 2432330401214134301 |
6 | 35511212141212401 |
7 | 2235525434206060 |
oct | 243233246140521 |
9 | 43654228373811 |
10 | 11222122021201 |
11 | 3637303359063 |
12 | 1312b09b61101 |
13 | 63531a9490b0 |
14 | 2ab2216bc1d7 |
15 | 146da6d11701 |
hex | a34da98c151 |
11222122021201 has 32 divisors (see below), whose sum is σ = 14329290205440. Its totient is φ = 8548161382656.
The previous prime is 11222122021183. The next prime is 11222122021213. The reversal of 11222122021201 is 10212022122211.
It is a de Polignac number, because none of the positive numbers 2k-11222122021201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11222122021291) 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 31 ways as a sum of consecutive naturals, for example, 5211666 + ... + 7043131.
It is an arithmetic number, because the mean of its divisors is an integer number (447790318920).
Almost surely, 211222122021201 is an apocalyptic number.
It is an amenable number.
11222122021201 is a deficient number, since it is larger than the sum of its proper divisors (3107168184239).
11222122021201 is a wasteful number, since it uses less digits than its factorization.
11222122021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12255193.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11222122021201 its reverse (10212022122211), we get a palindrome (21434144143412).
It can be divided in two parts, 1122212 and 2021201, that added together give a palindrome (3143413).
The spelling of 11222122021201 in words is "eleven trillion, two hundred twenty-two billion, one hundred twenty-two million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •