Base | Representation |
---|---|
bin | 100000010101011001100… |
… | …001101101001010101011 |
3 | 21212102101000012102010102 |
4 | 200111121201231022223 |
5 | 242401124011200021 |
6 | 4420434525340015 |
7 | 316351143135236 |
oct | 40253141551253 |
9 | 7772330172112 |
10 | 2222000100011 |
11 | 78738814681a |
12 | 2ba77b40760b |
13 | 1316c273bbb3 |
14 | 7978c73a41d |
15 | 3cbecaa000b |
hex | 2055986d2ab |
2222000100011 has 4 divisors (see below), whose sum is σ = 2293677522624. Its totient is φ = 2150322677400.
The previous prime is 2222000099993. The next prime is 2222000100127. The reversal of 2222000100011 is 1100010002222.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2222000100011 - 210 = 2222000098987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2222000099965 and 2222000100001.
It is not an unprimeable number, because it can be changed into a prime (2222000100511) 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 3 ways as a sum of consecutive naturals, for example, 35838711260 + ... + 35838711321.
It is an arithmetic number, because the mean of its divisors is an integer number (573419380656).
Almost surely, 22222000100011 is an apocalyptic number.
2222000100011 is a deficient number, since it is larger than the sum of its proper divisors (71677422613).
2222000100011 is an equidigital number, since it uses as much as digits as its factorization.
2222000100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71677422612.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2222000100011 its reverse (1100010002222), we get a palindrome (3322010102233).
The spelling of 2222000100011 in words is "two trillion, two hundred twenty-two billion, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •