Base | Representation |
---|---|
bin | 11110100101101010001… |
… | …010110010110010101001 |
3 | 21102221200101220002222022 |
4 | 132211222022302302221 |
5 | 233414414134101441 |
6 | 4245353232234225 |
7 | 304603010041001 |
oct | 36455212626251 |
9 | 7387611802868 |
10 | 2102020222121 |
11 | 740509685746 |
12 | 29b47639b975 |
13 | 1232b177b701 |
14 | 73a49d51001 |
15 | 39a2977184b |
hex | 1e96a2b2ca9 |
2102020222121 has 8 divisors (see below), whose sum is σ = 2108621520000. Its totient is φ = 2095424478000.
The previous prime is 2102020222067. The next prime is 2102020222147. The reversal of 2102020222121 is 1212220202012.
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 2102020222121 - 226 = 2101953113257 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2102020222121.
It is not an unprimeable number, because it can be changed into a prime (2102020222021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 629630 + ... + 2144871.
It is an arithmetic number, because the mean of its divisors is an integer number (263577690000).
Almost surely, 22102020222121 is an apocalyptic number.
It is an amenable number.
2102020222121 is a deficient number, since it is larger than the sum of its proper divisors (6601297879).
2102020222121 is a wasteful number, since it uses less digits than its factorization.
2102020222121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2776879.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 2102020222121 its reverse (1212220202012), we get a palindrome (3314240424133).
The spelling of 2102020222121 in words is "two trillion, one hundred two billion, twenty million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •