Base | Representation |
---|---|
bin | 100000001011001111111… |
… | …001010111001011101101 |
3 | 21211101020102211101221112 |
4 | 200023033321113023231 |
5 | 242211313341023041 |
6 | 4411433230241405 |
7 | 315514101225155 |
oct | 40131771271355 |
9 | 7741212741845 |
10 | 2211101111021 |
11 | 7827a4a30000 |
12 | 2b8639356265 |
13 | 13067672029a |
14 | 79037041765 |
15 | 3c7b0d14deb |
hex | 202cfe572ed |
2211101111021 has 40 divisors (see below), whose sum is σ = 2513344753920. Its totient is φ = 1943166297600.
The previous prime is 2211101110979. The next prime is 2211101111039. The reversal of 2211101111021 is 1201111011122.
It is not a de Polignac number, because 2211101111021 - 230 = 2210027369197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2211101110987 and 2211101111005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211101111521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 552359006 + ... + 552363008.
It is an arithmetic number, because the mean of its divisors is an integer number (62833618848).
Almost surely, 22211101111021 is an apocalyptic number.
It is an amenable number.
2211101111021 is a deficient number, since it is larger than the sum of its proper divisors (302243642899).
2211101111021 is an equidigital number, since it uses as much as digits as its factorization.
2211101111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5295 (or 5262 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 2211101111021 its reverse (1201111011122), we get a palindrome (3412212122143).
The spelling of 2211101111021 in words is "two trillion, two hundred eleven billion, one hundred one million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •