Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …10101010011001000001011 |
3 | 2220200012201011002121111121 |
4 | 11003111333111103020023 |
5 | 10403023031020041021 |
6 | 115131421131540111 |
7 | 4452225236435224 |
oct | 503257725231013 |
9 | 86605634077447 |
10 | 22220002112011 |
11 | 70974a4a10900 |
12 | 25aa4758ba637 |
13 | c5244cb012c2 |
14 | 56b64d4a424b |
15 | 287ed731e741 |
hex | 14357f55320b |
22220002112011 has 24 divisors (see below), whose sum is σ = 25963639102800. Its totient is φ = 18947370024000.
The previous prime is 22220002111961. The next prime is 22220002112029. The reversal of 22220002112011 is 11021120002222.
It is a happy number.
It is not a de Polignac number, because 22220002112011 - 219 = 22220001587723 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22220002112411) 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 23 ways as a sum of consecutive naturals, for example, 47614696 + ... + 48079093.
It is an arithmetic number, because the mean of its divisors is an integer number (1081818295950).
Almost surely, 222220002112011 is an apocalyptic number.
22220002112011 is a deficient number, since it is larger than the sum of its proper divisors (3743636990789).
22220002112011 is a wasteful number, since it uses less digits than its factorization.
22220002112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95693931 (or 95693920 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22220002112011 its reverse (11021120002222), we get a palindrome (33241122114233).
It can be divided in two parts, 2222000211 and 2011, that added together give a palindrome (2222002222).
The spelling of 22220002112011 in words is "twenty-two trillion, two hundred twenty billion, two million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •