Base | Representation |
---|---|
bin | 11110101101010001110… |
… | …110100100100000001001 |
3 | 21110201210121201202111121 |
4 | 132231101312210200021 |
5 | 234033143230431441 |
6 | 4253225152355241 |
7 | 305312530524046 |
oct | 36552166444011 |
9 | 7421717652447 |
10 | 2110202202121 |
11 | 743a28148392 |
12 | 2a0b7a545b21 |
13 | 123cb69099b0 |
14 | 741c486a1cd |
15 | 39d57c16dd1 |
hex | 1eb51da4809 |
2110202202121 has 16 divisors (see below), whose sum is σ = 2313752857920. Its totient is φ = 1912618607040.
The previous prime is 2110202202107. The next prime is 2110202202169. The reversal of 2110202202121 is 1212022020112.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2110202202121 - 217 = 2110202071049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2110202202095 and 2110202202104.
It is not an unprimeable number, because it can be changed into a prime (2110202202421) 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 15 ways as a sum of consecutive naturals, for example, 958435 + ... + 2266936.
It is an arithmetic number, because the mean of its divisors is an integer number (144609553620).
Almost surely, 22110202202121 is an apocalyptic number.
It is an amenable number.
2110202202121 is a deficient number, since it is larger than the sum of its proper divisors (203550655799).
2110202202121 is a wasteful number, since it uses less digits than its factorization.
2110202202121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3226296.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2110202202121 its reverse (1212022020112), we get a palindrome (3322224222233).
The spelling of 2110202202121 in words is "two trillion, one hundred ten billion, two hundred two million, two hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •