Base | Representation |
---|---|
bin | 100000010011100010010… |
… | …100101110110001011011 |
3 | 21212020012122001110210102 |
4 | 200103202110232301123 |
5 | 242333030023210021 |
6 | 4415504245010015 |
7 | 316250450302163 |
oct | 40234224566133 |
9 | 7766178043712 |
10 | 2220000210011 |
11 | 786551274871 |
12 | 2ba3016b390b |
13 | 13146430292c |
14 | 7963ccad5a3 |
15 | 3cb3221000b |
hex | 204e252ec5b |
2220000210011 has 8 divisors (see below), whose sum is σ = 2221057072080. Its totient is φ = 2218943482528.
The previous prime is 2220000210007. The next prime is 2220000210017. The reversal of 2220000210011 is 1100120000222.
It is a happy number.
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 2220000210011 - 22 = 2220000210007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2220000209974 and 2220000210001.
It is not an unprimeable number, because it can be changed into a prime (2220000210017) 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 7 ways as a sum of consecutive naturals, for example, 49510160 + ... + 49554978.
It is an arithmetic number, because the mean of its divisors is an integer number (277632134010).
Almost surely, 22220000210011 is an apocalyptic number.
2220000210011 is a deficient number, since it is larger than the sum of its proper divisors (1056862069).
2220000210011 is a wasteful number, since it uses less digits than its factorization.
2220000210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67293.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2220000210011 its reverse (1100120000222), we get a palindrome (3320120210233).
The spelling of 2220000210011 in words is "two trillion, two hundred twenty billion, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •