Base | Representation |
---|---|
bin | 11110110111011100000… |
… | …100010111111110000010 |
3 | 21111202221212120200022120 |
4 | 132313130010113332002 |
5 | 234223013404324302 |
6 | 4302231442145110 |
7 | 306150052054131 |
oct | 36673404277602 |
9 | 7452855520276 |
10 | 2121111011202 |
11 | 748615961087 |
12 | 2a3103952196 |
13 | 125034986301 |
14 | 7493b59d918 |
15 | 3a2957919bc |
hex | 1eddc117f82 |
2121111011202 has 8 divisors (see below), whose sum is σ = 4242222022416. Its totient is φ = 707037003732.
The previous prime is 2121111011191. The next prime is 2121111011353. The reversal of 2121111011202 is 2021101111212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
2121111011202 is an admirable number.
It is a super-2 number, since 2×21211110112022 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 176759250928 + ... + 176759250939.
It is an arithmetic number, because the mean of its divisors is an integer number (530277752802).
Almost surely, 22121111011202 is an apocalyptic number.
2121111011202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2121111011202 is a wasteful number, since it uses less digits than its factorization.
2121111011202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353518501872.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 2121111011202 its reverse (2021101111212), we get a palindrome (4142212122414).
The spelling of 2121111011202 in words is "two trillion, one hundred twenty-one billion, one hundred eleven million, eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •