Base | Representation |
---|---|
bin | 110010100001011100001011… |
… | …110011001000101110010011 |
3 | 1002010202010220010002022011210 |
4 | 302201130023303020232103 |
5 | 213111012234214404021 |
6 | 2104325231201311203 |
7 | 64542305225346141 |
oct | 6241341363105623 |
9 | 1063663803068153 |
10 | 222200331013011 |
11 | 648886a411933a |
12 | 20b07ab5335503 |
13 | 96ca52a892020 |
14 | 3cc27a677a591 |
15 | 1aa4e1945ee76 |
hex | ca170bcc8b93 |
222200331013011 has 64 divisors (see below), whose sum is σ = 339133368913920. Its totient is φ = 128396972551680.
The previous prime is 222200331012967. The next prime is 222200331013027. The reversal of 222200331013011 is 110310133002222.
It is not a de Polignac number, because 222200331013011 - 219 = 222200330488723 is a prime.
It is a super-2 number, since 2×2222003310130112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (222200331011011) 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, 90983806 + ... + 93394076.
It is an arithmetic number, because the mean of its divisors is an integer number (5298958889280).
Almost surely, 2222200331013011 is an apocalyptic number.
222200331013011 is a deficient number, since it is larger than the sum of its proper divisors (116933037900909).
222200331013011 is a wasteful number, since it uses less digits than its factorization.
222200331013011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2412556.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 222200331013011 its reverse (110310133002222), we get a palindrome (332510464015233).
The spelling of 222200331013011 in words is "two hundred twenty-two trillion, two hundred billion, three hundred thirty-one million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •