Base | Representation |
---|---|
bin | 100000010101111001001… |
… | …000011111011100010111 |
3 | 21212110201221222110121102 |
4 | 200111321020133130113 |
5 | 242403220233023421 |
6 | 4421003310540315 |
7 | 316400242236044 |
oct | 40257110373427 |
9 | 7773657873542 |
10 | 2222530361111 |
11 | 78762a4a1835 |
12 | 2ba8a8b0769b |
13 | 13177855aa68 |
14 | 797dcd2c1cb |
15 | 3cc2e3e460b |
hex | 2057921f717 |
2222530361111 has 8 divisors (see below), whose sum is σ = 2235424328544. Its totient is φ = 2209636933920.
The previous prime is 2222530361099. The next prime is 2222530361131. The reversal of 2222530361111 is 1111630352222.
2222530361111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2222530361111 - 210 = 2222530360087 is a prime.
It is a super-2 number, since 2×22225303611112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2222530361131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10567721 + ... + 10775981.
It is an arithmetic number, because the mean of its divisors is an integer number (279428041068).
Almost surely, 22222530361111 is an apocalyptic number.
2222530361111 is a deficient number, since it is larger than the sum of its proper divisors (12893967433).
2222530361111 is a wasteful number, since it uses less digits than its factorization.
2222530361111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270121.
The product of its (nonzero) digits is 4320, while the sum is 29.
The spelling of 2222530361111 in words is "two trillion, two hundred twenty-two billion, five hundred thirty million, three hundred sixty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •