Base | Representation |
---|---|
bin | 1000010001010100… |
… | …0001000101111011 |
3 | 12201201111212102102 |
4 | 2010111001011323 |
5 | 14021321231021 |
6 | 1004144254015 |
7 | 106005361421 |
oct | 20425010573 |
9 | 5651455372 |
10 | 2220102011 |
11 | a3a20a556 |
12 | 51b61130b |
13 | 294c4c33a |
14 | 170bd1111 |
15 | ced8d00b |
hex | 8454117b |
2220102011 has 8 divisors (see below), whose sum is σ = 2294659584. Its totient is φ = 2146682920.
The previous prime is 2220101999. The next prime is 2220102037. The reversal of 2220102011 is 1102010222.
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 a de Polignac number, because none of the positive numbers 2k-2220102011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2220101983 and 2220102001.
It is not an unprimeable number, because it can be changed into a prime (2220102211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 280655 + ... + 288456.
It is an arithmetic number, because the mean of its divisors is an integer number (286832448).
Almost surely, 22220102011 is an apocalyptic number.
2220102011 is a deficient number, since it is larger than the sum of its proper divisors (74557573).
2220102011 is an equidigital number, since it uses as much as digits as its factorization.
2220102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569241.
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 2220102011 is about 47117.9584765724. The cubic root of 2220102011 is about 1304.5407310156.
Adding to 2220102011 its reverse (1102010222), we get a palindrome (3322112233).
The spelling of 2220102011 in words is "two billion, two hundred twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •