Base | Representation |
---|---|
bin | 100000010011100010010… |
… | …100101100110101111111 |
3 | 21212020012122001001221211 |
4 | 200103202110230311333 |
5 | 242333030022431421 |
6 | 4415504244505251 |
7 | 316250450240146 |
oct | 40234224546577 |
9 | 7766178031854 |
10 | 2220000202111 |
11 | 78655126993a |
12 | 2ba3016ab227 |
13 | 1314642cc163 |
14 | 7963ccaa75d |
15 | 3cb3220c9e1 |
hex | 204e252cd7f |
2220000202111 has 32 divisors (see below), whose sum is σ = 2424450631680. Its totient is φ = 2031626201472.
The previous prime is 2220000202109. The next prime is 2220000202117. The reversal of 2220000202111 is 1112020000222.
It is a happy number.
2220000202111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2220000202111 - 21 = 2220000202109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2220000202091 and 2220000202100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2220000202117) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47087196 + ... + 47134318.
It is an arithmetic number, because the mean of its divisors is an integer number (75764082240).
Almost surely, 22220000202111 is an apocalyptic number.
2220000202111 is a deficient number, since it is larger than the sum of its proper divisors (204450429569).
2220000202111 is an equidigital number, since it uses as much as digits as its factorization.
2220000202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47440 (or 47406 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2220000202111 its reverse (1112020000222), we get a palindrome (3332020202333).
The spelling of 2220000202111 in words is "two trillion, two hundred twenty billion, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •